Test tube systems or how to bake a DNA cake

Acta Cybernetica

Volumn 12, Issue 4, 1996, Pages 445-459

  Freund, Rudolf ^a   Freund, Franziska ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b Gymnasium der Schulbrüder   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3142585540     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. L. M. Adleman, Molecular computation of solutions to combinatorial problems, Science, 226 (Nov. 1994), 1021-1024.
2. L. M. Adleman, On constructing a molecular computer, manuscript, January 1995.
3. D. Boneh, C. Dunworth, R.J. Lipton, J. Sgall, On the computational Power of DNA, to appear.
4. E. Csuhaj-Varjú, L. Kari, and Gh. Pǎun, Test tube distributed systems based on splicing, Computers and Artificial Intelligence, Vol. 15 (2) (1996), 211-232
5. E. Csuhaj-Varjú and A. Salomaa, Networks of parallel language processors, submitted.
6. E. Csuhaj-Varjú, Networks of language processors. A survey. In: Lenguajes Naturales Y Lenguajes Formales XII, C. Martin-Vide, ed., PPU, Barcelona, 1996, pp. 169-189.
7. R. Freund, L. Kari, and Gh. Pǎun, DNA computing based on splicing: The existence of universal computers, Techn. Report 185-2/FR-2/95, TU Wien, 1995.
8. R. Freund and F. Wachtler, Universal systems with operations related to splicing, Computers and Artificial Intelligence, Vol. 15 (4) (1996), 273-294.
9. R. Freund, E. Csuhaj-Varjú, and F. Wachtler, Test tube systems with cutting/recombination operations, Proceedings PSB'97, 1997.
10. V. Geffert, Context-free-like forms for the phrase-structure grammars, Proceedings MFCS'88, Lecture Notes in Computer Science, Vol. 324, Springer-Verlag, Berlin (1988), 309-317.
11. T. Head, Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biology, 49 (1987), 737-759.
12. R. J. Lipton, Speeding up computations via molecular biology, manuscript, December 1994.
13. Gh. Pǎun, Regular extended H systems are computationally universal, J. of Automata, Languages and Combinatorics, Vol. 1, Nr. 1 (1996), 27-37.
14. P. W. K. Rothemund, A DNA and restriction enzyme implementation of Turing machines, manuscript, 1995.
15. R. Siromoney, K. G. Subramanian, and V. R. Dare, Circular DNA and splicing systems, Lecture Notes in Computer Science, Vol. 654, Springer-Verlag, Berlin (1992), 260-273.
16. A. Salomaa, Formal Languages, Academic Press, New York, 1973.