Test tube distributed systems based on splicing

Computers and Artificial Intelligence

Volumn 15, Issue 2-3, 1996, Pages 211-232

  Csuhaj Varjú, Erzsébet ^a   Kari, Lila ^b   Pǎun, Gheorghe ^c  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

^c INSTITUTE OF MATHEMATICS   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745738576     PISSN: 02320274     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. ADLEMAN, L. M.: Molecular computation of solutions to combinatorial problems. Science, Vol. 226, 1994, pp. 1021-1024.
2. ADLEMAN, L. M.: On constructing a molecular computer. Manuscript in circulation, January 1995.
3. CALUDE, C. - PǍUN, GH.: Global syntax and semantics for recursively enumerable languages. Fundamenta Informatica, Vol. 4, 1981, No. 2, pp. 245-254.
4. CSUHAJ-VARJÚ, E. - DASSOW, J. - KELEMEN, J. - PǍUN, GH.: Grammar Systems. A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, Amsterdam 1994.
5. CULIK II, K. - HARJU, T.: Splicing semigroups of dominoes and DNA. Discrete Appl. Math., Vol. 31, 1991, pp. 261-277.
6. FREUND, R. - KARI, L. - PǍUN, GH.: DNA computing based on splicing: the existence of universal computers, submitted, 1995.
7. HEAD, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull. Math. Biology, Vol. 49, 1987, pp. 737-759.
8. HEAD, T. - PǍUN, GH. - PIXTON, D.: Language theory and molecular genetics. Chapter 8 in Volume 2 of Handbook of Formal Languages (G. Rozenberg, A. Salomaa, Eds.), in preparation.
9. LIPTON, R. J.: Speeding up computations via molecular biology. Manuscript in circulation, December 1994.
10. LIPTON, R. J.: DNA solution of hard computational problems. Science, Vol. 268, 1995, pp. 542-545.
11. PǍUN, GH.: Splicing. A challenge for formal language theorists. Bulletin of the EATCS, Vol. 57, 1995, pp. 183-194.
12. PǍUN, GH.: On the splicing operation. Discrete Appl. Math., to appear.
13. PǍUN, GH.: Regular extended H systems are computationally universal. J. Inform. Process. Cybern., EIK, to appear;
14. PǍUN, GH. - ROZENBERG, G. - SALOMAA, A.: Computing by splicing, submitted, 1995.
15. PǍUN, GH. - SANTEAN, L.: Parallel communicating grammar systems: the regular case. Ann. Univ. Buc., Matem.-Inform. Series, Vol. 38, 1989, No. 2, pp. 55-63.
16. PIXTON, D.: Regularity of splicing languages. Discrete Appl. Math., 1995.
17. TURING, A. M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc., Ser. 2, Vol. 42 1936, pp. 230-265; a correction, Vol. 43, 1936, pp. 544-546.
18. SALOMAA, A.: Formal Languages, Academic Press, New York 1973.