PCoL automata: recognizing strings with P colonies

1 Institute of Computer Science, Silesian University in Opava Bezrucovo nam. 13, 74601 Opava, Czech Republic {ludek.cienciala,lucie.ciencialova}@fpf.slu.cz 2 Computer and Automation Research Institute Hungarian Academy of Sciences Kende utca 13-17, 1111 Budapest, Hungary {csuhaj,vaszil}@sztaki.hu 3 Department of Algorithms and Their Applications Faculty of Informatics, Eotvos Lorand University Pazmany Peter setany 1/c, 1117 Budapest, Hungary

[1]  Jozef Kelemen,et al.  A grammar-theoretic treatment of multiagent systems , 1992 .

[2]  Rudolf Freund,et al.  P colonies and prescribed teams , 2006, Int. J. Comput. Math..

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

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

[5]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

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

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

[8]  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).

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

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

[11]  Patrick C. Fischer,et al.  Turing Machines with Restricted Memory Access , 1966, Inf. Control..

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