Direct constructions of universal extended H systems

A direct universal extended H system receives as input the coding of an extended H system with a particular control mechanism and simulates it. We present a direct construction for five kinds of control for the extended H systems under consideration. It is the first time that a direct construction is described: universal results obtained until now were based on the simulation of universal type-0 grammars or Turing machine.

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

[2]  A. Church.  Review: A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem , 1937 .

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

[4]  Hendrik Jan Hoogeboom,et al.  A Direct Construction of a Universal P System , 2002, Fundam. Informaticae.

[5]  Giancarlo Mauri,et al.  On the Universality of Post and Splicing Systems , 2000, MCU.

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

[7]  Pierluigi Frisco.  A Direct Construction of a Universal Extended H System , 2001, MCU.

[8]  Gheorghe Paun,et al.  Restricted use of the splicing operation , 1996, Int. J. Comput. Math..

[9]  Giancarlo Mauri,et al.  Simulating Turing Machines by Extended mH Systems , 1998 .

[10]  A. Turing,et al.  On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction , 1938 .

[11]  Claude E. Shannon,et al.  A Universal Turing Machine with Two Internal States , 1956 .

[12]  Gheorghe Paun,et al.  Computing by splicing: programmed and evolving splicing systems , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

[14]  Tom Head,et al.  Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors , 1987 .

[15]  Nor Muhainiah,et al.  Formal language theory and DNA , 2004 .

[16]  Gheorghe Paun.  Splicing Systems with Targets are Computationally Universal , 1996, Inf. Process. Lett..

[17]  Gheorghe Paun,et al.  On the Splicing Operation , 1996, Discret. Appl. Math..

[18]  Rudolf Freund,et al.  DNA Computing Based on Splicing: The Existence of Universal Computers , 1999, Theory of Computing Systems.

[19]  Gheorghe Paun,et al.  Regular Extended H Systems are Computationally Universal , 1996, J. Autom. Lang. Comb..

[20]  R. W. Gatterdam,et al.  On the undecidability of splicing systems , 1989 .

[21]  Gheorghe Paun.  Computing with Bio-Molecules: Theory and Experiments , 1999 .