论文信息 - P Automata with membrane channels

P Automata with membrane channels

We investigated a variant of purely communicating P systems that are able to accept multisets or even strings given as sequences of terminal symbols taken from the environment. We showed that such P automata with membrane channels equipped with only one membrane and specific activating and prohibiting rules can already recognize any recursively enumerable language of multisets and strings, respectively. Moreover, using only activating rules of a very special kind, we obtained a characterization of regular languages.

Rudolf Freund | Marion Oswald

[1] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[2] Gheorghe Paun,et al. Computing with Membranes , 2000, J. Comput. Syst. Sci..

[3] Rudolf Freund,et al. GP Systems with Forbidding Context , 2002, Fundam. Informaticae.

[4] Rudolf Freund,et al. A Short Note on Analysing P Systems with Antiport Rules , 2002, Bull. EATCS.

[5] Rudolf Freund,et al. P Systems with Activated/Prohibited Membrane Channels , 2002, WMC-CdeA.

[6] Jon Timmis. Membrane Computing: An Introduction (Book Review) , 2003 .

[7] Erzsébet Csuhaj-Varjú. P Automata , 2004, Workshop on Membrane Computing.

[8] Rudolf Freund,et al. On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars , 2001, MCU.

[9] Rudolf Freund,et al. Implementation of Catalytic P Systems , 2004, CIAA.

[10] Hendrik Jan Hoogeboom,et al. Simulating Counter Automata by P Systems with Symport/Antiport , 2002, WMC-CdeA.

[11] Marvin Minsky,et al. Computation : finite and infinite machines , 2016 .