Universality of Splicing Test Tube Systems with Two Tubes

Splicing test tube systems are one of the first distributed computing models based on splicing. The model introduces (test) tubes where the splicing operation is applied, which are arranged in a communication network with filters that permits to redistribute the words between the tubes at each step. We show that the computational completeness can be achieved with two tubes when the communication graph does not have self-loops. We also construct a universal splicing test tube system with 2 tubes having 23 rules.

[1]  Gheorghe Paun,et al.  Simulation Algorithms for Computational Systems Biology , 2017, Texts in Theoretical Computer Science. An EATCS Series.

[2]  Pierluigi Frisco,et al.  On Variants of Communicating Distributed H Systems , 2001, Fundam. Informaticae.

[3]  Rudolf Freund,et al.  Test tube systems with controlled applications of rules , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[4]  Erzsébet Csuhaj-Varjú,et al.  Test Tube Distributed Systems Based on Splicing , 1996, Comput. Artif. Intell..

[5]  T. Head.  Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. , 1987, Bulletin of mathematical biology.

[6]  Sergey Verlan.  A boundary result on enhanced time-varying distributed H systems with parallel computations , 2005, Theor. Comput. Sci..

[7]  Erzsébet Csuhaj-Varjú,et al.  On length-separating test tube systems , 2007, Natural Computing.

[8]  榊原 康文,et al.  G. Paun, G. Rozenberg and A. Salomaa : "DNA Computing-New Computing Paradigms", Springer-Verlag (1998) , 2000 .

[9]  Yurii Rogozhin,et al.  On the Rule Complexity of Universal Tissue P Systems , 2005, Workshop on Membrane Computing.

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

[11]  Rudolf Freund,et al.  Test tube systems: when two tubes are enough , 1999, Developments in Language Theory.

[12]  Andrei Păun,et al.  On membrane computing based on splicing , 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

[13]  John Cocke,et al.  Universality of Tag Systems with P = 2 , 1964, JACM.

[14]  Rudolf Freund,et al.  Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers , 2006, Workshop on Membrane Computing.

[15]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[16]  Gheorghe Paun,et al.  Language Theory and Molecular Genetics: Generative Mechanisms Suggested by DNA Recombination , 1997, Handbook of Formal Languages.

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

[18]  Artiom Alhazov,et al.  A Small Universal Splicing P System , 2010, Int. Conf. on Membrane Computing.

[19]  Rudolf Freund,et al.  Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems , 2004, Aspects of Molecular Computing.

[20]  Artiom Alhazov,et al.  Small Universal Tvdh and Test Tube Systems , 2011, Int. J. Found. Comput. Sci..

[21]  Emil L. Post.  Formal Reductions of the General Combinatorial Decision Problem , 1943 .

[22]  L Priese,et al.  Finite H-systems with 3 test tubes are not predictable. , 1998, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.