P Colonies and Their Extensions

P colonies are one of the variants of computational devices based on independent membrane agents, which are evolved and acting in a shared environment. P colonies belong to the family of models of membrane computing called P systems. We show that P colonies with capacity three and two agents using homogeneous programs without checking rules are computationally complete as well as eco-P colonies with two agents and a passive environment and PCol automata working in init mode.

[1]  Ludek Cienciala,et al.  Eco-P Colonies , 2009 .

[2]  David Corne,et al.  Membrane Computing - 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers , 2009, Workshop on Membrane Computing.

[3]  Ludek Cienciala,et al.  Homogeneous P Colonies , 2008, Comput. Informatics.

[4]  Erzsébet Csuhaj-Varjú,et al.  Computing with Cells in Environment: P Colonies , 2006, J. Multiple Valued Log. Soft Comput..

[5]  György Vaszil,et al.  PCoL automata: recognizing strings with P colonies , 2010 .

[6]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

[7]  Ludek Cienciala,et al.  On the Number of Agents in P Colonies , 2007, Workshop on Membrane Computing.

[8]  György Vaszil,et al.  On very simple P colonies , 2009 .

[9]  Erzsébet Csuhaj-Varjú,et al.  Variants of P Colonies with Very Simple Cell Structure , 2009, Int. J. Comput. Commun. Control.

[10]  Rudolf Freund,et al.  P colonies working in the maximally parallel and in the sequential mode , 2005, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05).

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

[12]  Erzsébet Csuhaj-Varjú,et al.  P Colonies with a Bounded Number of Cells and Programs , 2006, Workshop on Membrane Computing.