A universal time-varying distributed H-system of degree 2

BioSystems

Volumn 52, Issue 1-3, 1999, Pages 73-80

  Margenstern, Maurice ^a   Rogozhin, Yurii ^b  

^a Inst Universitaire de Technologie   (France)

^b NONE

Author keywords

DNA computing; Splicing systems; Tag systems; Turing machines

Indexed keywords

ARTICLE; CALCULATION; COMPUTER; MATHEMATICAL ANALYSIS; MATHEMATICS; THEORY;

EID: 0032731222     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0303-2647(99)00034-9     Document Type: Article

References (16)

1. Ferretti, C., Mauri, G., Zandron, C., 1999. Nine test tubes generate any RE language. TCS special issue on MCU '98 (in press).
2. Head T. Formal language theory and DNA: an analysis of the generative capacity of recombinant behaviors. Bull. Math. Biol. 49:1987;737-759.
3. Head, T., Paun, Gh., Pixton D., 1997. Language theory and molecular genetics. Generative mechanisms suggested by DNA recombination. In: Rozenberg, G., Salomaa, A. (Eds.), Handbook of Formal Languages, vols. 1-4. Springer-Verlag, Heidelberg, chapter 7 in vol. 2.
4. Margenstern, M., 1993. Non-erasing Turing machines: on the frontier between a decidable halting problem and universality. Lecture notes in computer science. In: Proceedings of FCT '93, 710, pp. 375-385.
5. Margenstern, M., 1995. Non-erasing Turing machines: a new frontier between a decidable halting problem and universality. Lecture notes in computer science. In: Proceedings of LATIN '95, 911, 386-397.
6. Margenstern, M., 1998. Frontier between decidability and undecidability: a survey. In: Proceedings of MCU '98, vol. I, ISBN 2-9511539-2-9, pp. 141-177.
7. Margenstern, M., Rogozhin, Yu., 1998. A universal time-varying distributed H-system of degree 2. In: Preliminary Proceedings, Fourth International Meeting on DNA Based Computers, June 15-19, University of Pennsylvania, pp. 83-84.
8. Minsky M.L. Computation: Finite and Infinite Machines. 1967;Prentice Hall, Englewood Cliffs, NJ.
9. Paun, G., 1997. DNA computing: distributed splicing systems. In: Structures in Logic and Computer Science. A Selection of Essays in honor of A. Ehrenfeucht, Lecture Notes in Computer Science 1261, Springer-Verlag, pp. 353-370.
10. Paun, G., 1998. DNA computing based on splicing: universality results. In: Proceedings of MCU '98, vol. I, ISBN 2-9511539-2-9, pp. 67-91.
11. Pixton D. Regularity of splicing languages. Discret. Appl. Math. 69(1-2):1996;99-122.
12. Priese L. Towards a precise characterization of the complexity of universal and non-universal Turing machines. SIAM J. Comput. 8(4):1979;508-523.
13. Priese, L., Rogozhin, Yu., Margenstern, M., 1998. Finite H-Systems with 3 test tubes are not predictable. In: Altman, R.B., Dunker, A.K., Hunter, L., Klein, T.E. (Eds.), Proceedings of Pacific Symposium on Biocomputing, Kapalua, Maui, January 1998, World Scientific Publishing, Singapore, pp. 545-556.
14. Paun G., Rozenberg G., Salomaa A. Computing by splicing. TCS special issue on universal machines and computations. 168-2:1996;321-336.
15. Rogozhin, Yu. V., 1982, Sem' universal'nykh mashin T'juringa. Matematicheskie Issledovanija, 69, 76-90, (Seven universal Turing machines) (in Russian).
16. Rogozhin, Yu. V., 1996, Small universal Turing machines. TCS, special issue on Universal Machines and Computations, 168-2, 215-240.