On the universality of Post and splicing systems

Theoretical Computer Science

Volumn 231, Issue 2, 2000, Pages 157-170

  Ferretti, C ^a   Mauri, G ^a   Kobayashi, S ^b   Yokomori, T ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

DNA computer; Post system; Splicing system

Indexed keywords

EID: 0347997389     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00097-3     Document Type: Article

References (16)

1. L. Adleman, Molecular computation of solutions to combinatorial problems, Science 266 (1994) 1021-1024 .
2. G. Alford, Explicitly constructing universal extended H system, in: C. Calude, J. Casti, M.J. Dinneen (Eds.), Unconventional Models of Computation, Springer, Singapore, 1998, pp. 108-117.
3. D. Beaver, A universal molecular computer, in: DNA Based Computers, DIMACS Series in Discr. Math. and Theor. Comp. Sci., vol. 27, 1996.
4. K. Culik II, T. Harju, Dominoes and the regularity of DNA splicing languages, Discrete Appl. Math. 31 (1991) 261-277.
5. R. Freund, L. Kari, and Gh. Paun, DNA computing based on splicing: the existence of universal computers, Technical Report, Fachgruppe Informatik, Tech. Univ. Wien.
6. C. Ferretti, S. Kobayashi, DNA splicing systems and Post systems, in: Biocomputing: Proc. Pacific Symp., World Scientific Publishing Co., Singapore, 1996, pp. 288-299.
7. P. Frisco, G. Mauri, C. Ferretti, Simulating Turing machines by extended mH systems, in: G. Paun (Ed.), Computing with Bio-Molecules, Springer, Singapore, 1998, pp. 221-238.
8. R.W. Gatterdam, Splicing systems and regularity, Internat. J. Comput. Math. 31 (1989) 63-67.
9. T. Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biol. 49 (1987) 737-759.
10. T. Head, Splicing schemes and DNA, in: G. Rozenberg, A. Salomma (Eds.), Lindenmayer Systems, Springer, Berlin, 1992, pp. 371-383.
11. G. Paun, On the splicing operation, Discrete Appl. Math. 70(1) (1996) 57-79.
12. Gh. Paun, Regular extended H systems are computationally universal, J. Automat. Languages Combin. 1(1) (1996) 27-36.
13. D. Pixton, Regularity of splicing languages, Discrete Appl. Math. 69(1-2) (1996) 99-122.
14. E. L. Post, Formal reductions of the general combinatorial decision problem, Amer. J. Math. 65 (1943) 197-215.
15. R. Siromoney, K.G. Subramanian, V.R. Dare, Circular DNA and splicing systems, in: Proc. Internat. Conf. on Parallel Image Analysis, Lecture Notes in Computer Science, vol. 654, Springer, Berlin, 1992, pp. 260-273.
16. T. Yokomori, S. Kobayashi, C. Ferretti, On the power of circular splicing systems and DNA computability, Proc. IEEE Internat. Conf. on Evolutionary Computation, 1997.