A Universal Time-Varying Distributed H System of Degree 1

A time-varying distributed H system is a splicing system which has the following feature: at different moments one uses different sets of splicing rules. The number of these sets is called the degree of the system. The passing from a set of rules to another one is specified in a cycle. It is a well known fact that any formal language can be generated by a time-varying distributed H-system of degree at least 7. Here we prove that there are universal time-varying distributed H-systems of degree 2. The question of whether or not there are universal time-varying distributed H-systems of degree 1 remains open.

[1]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[2]  Yurii Rogozhin,et al.  Small Universal Turing Machines , 1996, Theor. Comput. Sci..

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

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

[5]  Maurice Margenstern,et al.  Time-varying distributd H-systems of degree 2 generate all recursively enumerable languages , 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

[6]  Maurice Margenstern,et al.  Frontier between decidability and undecidability: a survey , 2000, Theor. Comput. Sci..

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

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

[9]  David I. Lewin,et al.  DNA computing , 2002, Comput. Sci. Eng..

[10]  Gheorghe Paun,et al.  DNA Computing: Distributed Splicing Systems , 1997, Structures in Logic and Computer Science.

[11]  Maurice Margenstern,et al.  A universal time-varying distributed H-system of degree 2 , 1999 .

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

[13]  Maurice Margenstern,et al.  About Time-Varying Distributed H Systems , 2000, DNA Computing.

[14]  Andrei Paun.  On Time-Varying H Systems , 1999, Bull. EATCS.

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

[16]  Lutz Priese,et al.  Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines , 1979, SIAM J. Comput..

[17]  Maurice Margenstern,et al.  Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality , 1995, LATIN.

[18]  Grzegorz Rozenberg,et al.  Structures in Logic and Computer Science , 1997, Lecture Notes in Computer Science.

[19]  Gheorghe Paun,et al.  DNA computing based on splicing: universality results. , 1996, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.