Splicing systems for universal turing machines

Lecture Notes in Computer Science

Volumn 3384, Issue , 2005, Pages 149-158

  Harju, Tero ^a   Margenstern, Maurice ^b  

^a UNIVERSITY OF TURKU   (Finland)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

DNA computing; Splicing systems

Indexed keywords

CODES (SYMBOLS); ENCODING (SYMBOLS);

SPLICING SYSTEMS; TERMINAL SYMBOLS;

MACHINERY;

EID: 24144448579     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11493785_13     Document Type: Conference Paper

References (15)

1. Culik, K., II and Harju, T., Splicing semigroups of dominoes and DNA, Discrete Appl. Math., 31, (1991), 261-277.
2. Ferretti C. and Frisco P., Mauri G., Simulating Turing machines through extended mH systems, Computing with Bio-Molecules. Theory and Experiments, (G. Pǎun, ed.), Springer Verlag, (1998), 221-238.
3. Freund R., Kari L., and Pǎun G., DNA computation based on splicing: the existence of a universal computer, Theory of Computing Systems, 32, (1999), 69-112.
4. Ferretti, C., Mauri, G., Kobayashi, S., and Yokomori, T., On the universality of Post and splicing systems. Universal machines and computations (Metz, 1998). Theoret. Comput. Sci., 231, (2000), 157-170.
5. Harju, T. and Margenstern, M. Remarks on the universality of splicing systems, TUCS Report (2004).
6. Kleene S.C., A note on recursive functions, Bulletin of the American Mathematical Society, 42, 544bis-546, (1936).
7. Margenstern M., Turing machines: universality and limits of computational power, in Formal Languages and Applications, C. Martin-Vide, V. Mitrana, Gh. Pǎun, ed., Springer-Verlag, to appear.
8. Margenstern M., Rogozhin Yu. About Time-Varying Distributed H-systems, Lecture Notes in Computer Science, 2054, (2000), 53-62.
9. Margenstern M., Rogozhin Yu., Verlan S., Time-vary ing distributed H sytems with parallel computations: the problem is solved, Lecture Notes of Computer Sciences, 2943, (2004), 48-53.
10. Minsky M.L., Size and structure of universal Turing machines using Tag systems, Proc. Sympos. Pure Math., 5, (1962), 229-238.
11. Pǎun, Gh., Rozenberg, G., Salomaa, A., DNA Computing, Springer-Verlag, Berlin Heidelberg, 1998.
12. Pixton, D., Regularity of splicing languages, Discrete Appl. Math. 69, (1996), 101-124.
13. Rogozhin Yu., Seven universal Turing machines, Mat. Issled., No. 69, (1982), 76-90.
14. Rogozhin Yu., Small universal Turing machines, Theoret. Comput. Sci., 168, (1996), 215-240.
15. Verlan S., A frontier result on enhanced time-varying distributed H systems with parallel computations, Preproceedings of DCFS'03, Descriptional Complexity of Formal Systems, Budapest, Hungary, July 12-14, (2003), 221-232.