Back to Search Start Over

P systems based computing polynomials: design and formal verification

Authors :
Gexiang Zhang
Zhiwei Huang
Weitao Yuan
Mario J. Pérez-Jiménez
Tao Wang
Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Universidad de Sevilla. TIC193 : Computación Natural
Ministerio de Economía y Competitividad (MINECO). España
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

Details

Language :
English
Database :
OpenAIRE
Journal :
idUS. Depósito de Investigación de la Universidad de Sevilla, instname
Accession number :
edsair.doi.dedup.....b1c628663beb6d08bf7032cf32d8395f