Contextual Insertions/Deletions and Computability

Information and Computation

Volumn 131, Issue 1, 1996, Pages 47-61

  Kari, Lila ^a   Thierrin, Gabriel ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001847378     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0091     Document Type: Article

References (18)

1. Adleman, L. (1994), Molecular computation of solutions to combinatorial problems, Science 266, 1021-1024.
2. Adleman, L., On constructing a molecular computer, available ftp://usc.edu/pub/csinfo/papers/ adleman.
3. Beaver, D. (1995), A universal molecular computer, in "Proceedings of the DIMACS Workshop on DNA-Based Computing," Princeton.
4. Boneh, D., Lipton, R., Dunworth, C., and Sgall, J., On the computational power of DNA, available http://www.cs.princeton.edu/∼dabo.
5. Dieffenbach, C. W., and Dveksler, G. S., Eds., (1995), "A Laboratory Manual," 581-621, Cold Spring Harbor Laboratory Press.
6. Freund, R., Kari, L., and Paun, G. (1995), "DNA Computing Based on Splicing: The Existence of Universal Computers," Technical Report 185-2/FR-2/95, Institute for Computer Languages, Technische Universität Wien, also available http://www.csd.uwo.ca/∼lila.
7. Galiukschov, B. S. (1981), Semicontextual grammars, Mat. Log. Mat. Ling., 38-50. [In Russian]
8. Head, T. (1987), Formal language theory and DNA: An analysis of the generative capacity of recombinant behaviors, Bull. Math. Biol. 49, 737-759.
9. Kari, L. (1991), "On Insertions and Deletions in Formal Languages," Ph.D. thesis, University of Turku, Finland.
10. Kari, L. (1994), On language equations with invertible operations, Theoret. Comput. Sci. 132, 129-150.
11. Kari, L. (1994), Deletion operations: Closure properties, Int. J. Comput. Math. 52, 23-42.
12. Paun, G. (1984), On semicontextual grammars, Bull. Math. Soc. Sci. Math. Rouman. 28 (76), 63-68.
13. Paun, G. (1985), Two theorems about Galiukschov grammars, Kybernetika 21, 360-365.
14. Rothemund, P., A DNA and restriction enzyme implementation of Turing machines, abstract at http://www.ugcs.caltech.edu/pwkr/oett.html.
15. Salomaa, A. (1973), " Formal Languages," Academic Press, New York.
16. Squier, C. C. (1988), Semicontextual grammars: An example, Bull. Math. Soc. Sci. Math. Rouman. 32 (80), 167-170.
17. Smith, W., and Schweitzer, A. (1995), "DNA Computers in vitro and in vivo," NEC Technical Report.
18. Winfree, E., On the computational power of DNA annealing and ligation, available http://dope. caltech.edu/winfree/DNA.html.