Back to Search
Start Over
P systems based computing polynomials: design and formal verification
- Source :
- idUS. Depósito de Investigación de la Universidad de Sevilla, instname
- Publication Year :
- 2016
- Publisher :
- Springer, 2016.
-
Abstract
- Automatic design of P systems is an attractive research topic in the community of membrane computing. Differing from the previous work that used evolutionary algorithms to fulfill the task, this paper presents the design of a (deterministic transition) P system (without input membrane) of degree 1, capturing the value of an arbitrary k-order (k 2) polynomial p(n) by using a reasoning method. Specifically, the values of p(n) corresponding to a natural number t is equal to the multiplicity of a distinguished object of the system (the output object) in the configuration at instant t. We also discuss the descriptive computational resources required by the designed k-order polynomial P system. Ministerio de Economía y Competitividad TIN2012-37434
- Subjects :
- Polynomial
Theoretical computer science
Degree (graph theory)
Automatic design
Computer science
P systems
Evolutionary algorithm
02 engineering and technology
021001 nanoscience & nanotechnology
Object (computer science)
Computer Science Applications
Theory of computation
0202 electrical engineering, electronic engineering, information engineering
Membrane computing
020201 artificial intelligence & image processing
0210 nano-technology
Formal verification
P system
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Journal :
- idUS. Depósito de Investigación de la Universidad de Sevilla, instname
- Accession number :
- edsair.doi.dedup.....b1c628663beb6d08bf7032cf32d8395f