<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Weitao Yuan</style></author><author><style face="normal" font="default" size="100%">Gexiang Zhang</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Tao Wang</style></author><author><style face="normal" font="default" size="100%">Zhiwei Huan</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">P systems based computing polynomials: Design and formal verification</style></title><secondary-title><style face="normal" font="default" size="100%">Asian Conference on Membrane Computing (ACMC 2015)</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Proceedings of the Asian Conference on Membrane Computing (ACMC 2015)</style></tertiary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">automatic design</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">P system</style></keyword><keyword><style  face="normal" font="default" size="100%">polynomial</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">11/2015</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.cs.us.es/~marper/investigacion/P%20system%20solving%20polynomial%20problem.pdf</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">1</style></volume><pages><style face="normal" font="default" size="100%">1-9</style></pages><abstract><style face="normal" font="default" size="100%">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 simple (deterministic transition) P system
(without input membrane) of degree 1, capturing the value of the korder
(k ≥ 2) polynomial by using a reasoning method. Specifically, the
values of polynomial 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</style></abstract></record></records></xml>