Artículo
P systems based computing polynomials: design and formal verification
Autor/es | Yuan, Weitao
Zhang, Gexiang Pérez Jiménez, Mario de Jesús Wang, Tao Huang, Zhiwei |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2016 |
Fecha de depósito | 2021-11-30 |
Publicado en |
|
Resumen | 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 ... 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. |
Agencias financiadoras | Ministerio de Economía y Competitividad (MINECO). España |
Identificador del proyecto | TIN2012-37434 |
Cita | Yuan, W., Zhang, G., Pérez Jiménez, M.d.J., Wang, T. y Huang, Z. (2016). P systems based computing polynomials: design and formal verification. Natural Computing, 15 (4), 591-596. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Yuan2016_Article_PSystemsBased ... | 259.8Kb | [PDF] | Ver/ | |