Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Păun G (2000) Computing with membranes. J Comput Syst Sci 61:108–143
Păun G (2002) Membrane computing -an introduction. Springer, Berlin Heidelberg New York
http://psystems.disco.unimib.it
Păun A, Păun G (2002) The power of communication: P systems with symport/antiport. New Generat Comput 20:295–306
Frisco P, Hoogeboom HJ (2003) Simulating counter automata by P systems with symport/antiport. In: Păun G, Rozenberg G, Salomaa A, et al. (eds) Membrane computing: international workshop, WMC-CdeA 2002, LNCS 2597, Springer, Berlin Heidelberg New York, pp 288–301
Freund R, Oswald M (2003) P systems with activated/prohibited membrane channels. In: Păun G, Rozenberg G, Salomaa A, et al. (eds) Membrane computing: international workshop, WMC-CdeA 2002, LNCS 2597, Springer, Berlin Heidelberg New York, pp 261–269
Csuhaj-Varjú E, Vaszil G (2002) P automata. In: Păun G, Zandron C (eds) Preproceedings of workshop on membrane computing (WMC-CdeA 2002), Curtea de Arge§, Romania, pp 177–192
Freund R, Oswald M (2002) A short note on analysing P systems with antiport rules. Bulletin EATCS 78:231–236
Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages. Springer, Berlin Heidelberg New York
Minsky ML (1967) Computation: finite and infinite machines. Prentice Hall, Englewood Cliffs, New Jersey, USA
Freund R, Oswald M (2002) Generalized P systems with forbidding context. Fund Inform 49:81–102
Freund R, Păun G (2001) On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars. In: Margenstern M, Rogozhin Y (eds) Machines, computations, and universality: third international conference, MCU 2001, LNCS 2055, Springer, Berlin Heidelberg New York, pp 214–226
Binder A, Freund R, Lojka G, et al. (2004) Implementation of catalytic P systems. In: Domaratzky M, Okothin A, Salomaa K, et al. (eds) Preproceedings CIAA 2004, Queen’s University, Kingston, Ontario, Canada, pp 24–33
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was presented, in part, at the 8th International Symposium on Artificial Life and Robotics, Oita, Japan, January 24#x2013;26, 2003.
About this article
Cite this article
Freund, R., Oswald, M. P Automata with membrane channels. Artif Life Robotics 8, 186–189 (2004). https://doi.org/10.1007/s10015-004-0312-x
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10015-004-0312-x