A direct construction of a universal extended H system

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2055 LNCS, Issue , 2001, Pages 226-239

  Frisco, Pierluigi ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

MICROCONTROLLERS;

EXTENDED H;

TURING MACHINES;

EID: 0013418956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45132-3_15     Document Type: Conference Paper

References (18)

1. G. Alford, Explicitly constructing universal extended H systems. In Calude et al. Proceedings of the UMC, Auckland, New Zealand, 5-11 January 1998
2. E. Csuhaj-Varju, R. Freund, L. Kari, Gh. Pǎun: DNA computing based on splicing: universality results. Proc. First Annual Pacific. Symposium in Biocomputing, Hawaii, 1996 (L. Hunter, T. E. Klein, eds.), World Sci., Singapore, 1996, 179-190
3. K. L. Denninghoff, R. W. Gatterdam: On the undecidability of splicing systems. International Journal of Computer and Mathematics, 27(1989), 133-145
4. C. Ferretti, G. Mauri, S. Kobayashi, T. Yokomori: On the universality of Post and splicing systems. In Lawrence Hunter and Teri Klein, editors. Biocomputing: Proceedings of the 1996 Pacific Symposium pages 288-299. World Scientific Publishing Co., Singapore, January 1996, ISBN 981-02-2578-4.
5. R. Freund, F. Freund, M. Oswald: Universal H systems using multisets, man., 1997
6. R. Freund, L. Kari. G. Pǎun: DNA computing based on splicing. The existence of universal computers. Technical Report 185-2/FR-2/95, Technical Univ. Wien, 1995, and Theories of Computer Sci. in press
7. P. Frisco A direct construction of a universal extended H system, technical report 2000-08, Universiteit Leiden
8. P. Frisco, G. Mauri and C. Ferretti. Simulating Turing machines by extended mH systems. In G. Paun, editor, Computing with bio-molecules. Theory and experiments, pages 221-238. Springer Verlag, Berlin, Heidelberg, New York., 1998
9. T. Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bulletin of Math. Biology, 49(1987), 737-759
10. A. Mu Turing: On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc., Ser. 2, 42(1936), 230-265;
11. a correction, 43(1936), 544-546
12. Gh. Pǎun: DNA computing based on splicing: universality results. Proc. of the Sec. Int. Coll. on Universal Machines and Computations, Metz, 1998, Vol. I, 67-91
13. Gh. Pǎun, On the splicing operation, Discrete Appl. Math., 70(1996), 57-79
14. Gh. Pǎun: Splicing systems with targets are computationally complete. Inform. Processing Letters, 59(1996), 129-133
15. Gh. Pǎun, G. Rozenberg, A. Salomaa: Computing by splicing. Programmed and evolving splicing systems. IEEE Inter. Conf. on Evolutionary Computing, Indianapolis, 1997, 273-277
16. G. Pǎun, G. Rozenberg, A. Salomaa. DNA Computing, Springer Verlag, 1998
17. Y. Rogozhin: Small universal Turing machines. TCS, 168-2(1996), 215-240
18. C. E. Shannon: A universal Turing machine with two internal states. Automata Studies, Annals of Mathematical Studies, 34, Princeton Univ. Press, 1956, 157-165