Home › Biblio

dP automata versus right-linear simple matrix grammars

Thu, 06/09/2011 - 13:43 — manu
TitledP automata versus right-linear simple matrix grammars
Publication TypeConference Contributions
Year of Publication2011
AuthorsPaun, G., & Pérez-Jiménez M. J.
Conference NameNinth Brainstorming Week on Membrane Computing
Volume TitleProceedings of the Ninth Brainstorming Week on Membrane Computing
PublisherFénix Editora
Place PublishedSeville, Spain
Pages293-304
Date Published02/2011
Abstract

We consider dP automata with the input string distributed in an arbitrary
(hence not necessary balanced) way, and we investigate their language accepting power,
both in the case when a bound there is on the number of objects present inside the system
and in the general case. The relation with right-linear simple matrix grammars is useful
in this respect. Some research topics and open problems are also formulated.
URLhttp://www.gcn.us.es/9BWMC/volume/21dPsystemsCris.pdf