About time-varying distributed H systems

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

Volumn 2054, Issue , 2001, Pages 53-62

  Margenstern, Maurice ^a   Rogozhin, Yurii ^b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b INSTITUTE OF CHEMISTRY   (Moldova)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; COMPUTATIONAL LINGUISTICS; DNA; TURING MACHINES;

FORMAL GRAMMARS; MOLECULAR COMPUTATIONS; NUMBER OF COMPONENTS; PARALLEL SOLUTIONS; RECURSIVELY ENUMERABLE LANGUAGES; SPLICING OPERATION; SPLICING SYSTEMS; TWO-COMPONENT;

MODELING LANGUAGES;

EID: 84958952280     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44992-2_5     Document Type: Conference Paper

References (19)

1. Csuhaj-Varjău, E., Kari, L., Păun, G.: Test Tube distributed system based on splic-ing. Computer and AI. 2-3 (1996) 211-232
2. Ferretti, C., Mauri, G., Zandron, C.: Nine test tubes generate any RE language. TCS. 231, no.2 (2000) 171-180
3. Head, T.: Formal language theory and DNA: an analysis of the generative capacity of recombinant behaviors. Bulletin of Mathematical Biology 49 (1987) 737-759
4. Head, T., Păun, Gh., Pixton, D.: Language theory and molecular genetics. Generative mechanisms suggested by DNA recombination. Chapter 7 in vol.2 of G.Rozenberg, A.Salomaa, eds., Handbook of Formal Languages, 3 volumes, Springer-Verlag, Heidelberg (1997)
5. Margenstern, M.: Frontier between decidability and undecidability: a survey. TCS. 231, no.2 (2000) 217-251
6. Margenstern, M., Rogozhin, Yu.: A universal time-varying distributed H-system of degree 2. In Preliminary proceedings, Fourth International Meeting on DNA Based Computers, June 15-19, 1998, University of Pennsylvania (1998) 83-84
7. Margenstern, M., Rogozhin, Yu.: A universal time-varying distributed H-system of degree 2. Biosystems 52 (1999) 73-80
8. Margenstern, M., Rogozhin, Yu.: Generating all recursively enumerable languages with a time-varying distributed H-system of degree 2. Publications du GIFM, no. 99-102, I.U.T., Metz (France), ISBN 2-9511539-5-3 (1999)
9. Păun, A.: On Time-Varying H Systems. Bulletin of EATCS. 67 (1999) 157-164
10. Păun, G.: Regular extended H systems are computationally universal. Journal of Automata, Languages and Combinatorics 1, no.1 (1996) 27-36
11. Păun, G., Rozenberg, G., Salomaa, A.: Computing by splicing. TCS. 168, no.2 (1996) 321-336
12. Păun, G.: DNA computing: distributed splicing systems. In Structures in Logic and Computer Science. A Selection of Essays in honor of A. Ehrenfeucht, LNCS. 1261 (1997) 353-370
13. Păun, G.: DNA Computing Based on Splicing: Universality Results. TCS. 231, no.2 (2000) 275-296
14. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)
15. Pixton, D.: Regularity of splicing languages. Descrete Applied Mathematics 69 (1996) 101-124
16. Priese, L., Rogozhin, Yu., Margenstern, M.: Finite H-Systems with 3 Test Tubes are not Predictable. In Proceedings of Paciăc Symposium on Biocomputing, Kapalua, Maui, January 1998 (R.B.Altman, A.K.Dunker, L.Hunter, T.E.Klein, eds), World Sci. Publ., Singapure (1998) 545-556
17. Rogozhin, Yu.: Small universal Turing machines. TCS. 168, no.2 (1996) 215-240
18. Rogozhin, Yu.: A Universal Turing Machine with 22 States and 2 Symbols. Roma-nian Journal of Information Science and Technology 1, no.3 (1998) 259-265
19. Verlan, S.: On extended time-varying distributed H systems. Poster at DNA6 con-ference, Leiden (2000)