On Communication in Tissue P Systems : Conditional Uniport

The paper introduces (purely communicative) tissue P systems with conditional uniport. Conditional uniport means that every application of a communication rule moves one object in a certain direction by possibly using another one as an activator which is left untouched in the place where it is. Tissue P systems with conditional uniport are shown to be computationally complete in the sense that they can recognise all recursively enumerable sets of natural numbers. This is achieved by simulating deterministic register machines.

[1]  Eric Goles Ch.,et al.  Universality of the Chip-Firing Game , 1997, Theor. Comput. Sci..

[2]  Tommaso Toffoli,et al.  Cellular Automata Machines , 1987, Complex Syst..

[3]  Marian Gheorghe,et al.  On Self-assembly in Population P Systems , 2005, UC.

[4]  Carlos Martín-Vide,et al.  Membrane systems with carriers , 2002, Theor. Comput. Sci..

[5]  Marian Gheorghe,et al.  Cell communication in tissue P systems: universality results , 2005, Soft Comput..

[6]  Maurice Margenstern.  Two railway circuits: a universal circuit and an NP-difficult one , 2001, Comput. Sci. J. Moldova.

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

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

[9]  Wolfgang Reisig,et al.  Petri Nets , 1985, EATCS Monographs on Theoretical Computer Science.

[10]  Erzsébet Csuhaj-Varjú,et al.  P Automata or Purely Communicating Accepting P Systems , 2002, WMC-CdeA.

[11]  Artiom Alhazov,et al.  Computational Power of Symport/Antiport: History, Advances, and Open Problems , 2005, Workshop on Membrane Computing.

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