Splicing representations of strictly locally testable languages

Discrete Applied Mathematics

Volumn 87, Issue 1-3, 1998, Pages 139-147

  Head, Tom ^a  

^a BINGHAMTON UNIVERSITY   (United States)

Author keywords

DNA computing; H systems; Local testability; Regular languages; Restriction enzymes; Splicing systems

Indexed keywords

EID: 0042221276     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00053-5     Document Type: Article

References (21)

1. K. Culik II, T. Harju, The regularity of splicing systems and DNA, in: Proc. ICALP '89, LNCS 372 (1989) 222-233.
2. K. Culik II, T. Harju, Splicing semigroups of dominoes and DNA, Discrete Appl. Math. 31 (1991) 261-277.
3. A. DeLuca, A. Restivo, A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup, Inform. and Control 44 (1980) 300-319.
4. C. Ferretti, S. Kobayashi, DNA splicing systems and post systems, in: Proceedings of the Pacific Symposium on Biocomputing '96, World Scientific, Singapore, 1995, pp. 288-299.
5. R. Freund, E. Csuhaj-Varju, F. Watchler, Test tube systems with cutting/recombination operations, in: Proceedings of the Pacific Symposium on Biocomputing '97, World Scientific, Singapore, 1996, pp. 163-174.
6. T. Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biol. 49 (1987) 737-759.
7. T. Head, Splicing schemes and DNA, in: G. Rozenberg, A. Salomaa (Eds.), Lindenmayer Systems -Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology, Springer, Berlin, pp. 371-383, 1992; also in: Nanobiology 1 (1992) 335-342.
8. T. Head, Splicing schemes and DNA, in: G. Rozenberg, A. Salomaa (Eds.), Lindenmayer Systems - Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology, Springer, Berlin, pp. 371-383, 1992; also in: Nanobiology 1 (1992) 335-342.
9. T. Head, Splicing Languages generated with one sided context, 84 (1998) 145-163.
10. T. Head, Gh. Paun, D. Pixton, Language theory and molecular genetics: generative mechanisms suggested by DNA recombination, a chapter in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. 2, Springer, New York, 1996, pp. 295-360.
11. L. Kari, DNA computing: arrival of biological mathematics, Math. Intelligencer 19 (1997) 9-22.
12. E. Laun, K.J. Reddy, Wet splicing systems, in: Proceedings of the 3rd DIMACS Workshop on DNA Based Computers, U. Penn., 1997.
13. A. Mateescu, Gh. Paun, G. Rozenberg, A. Salomaa, Simple splicing systems, Discrete Appl. Math. in: Biomolecular Computing. Theory and Experiment, Gh. Paun, ed. (Springer), to appear.
14. R. McNaughton, S. Papert, Counter-Free Automata, MIT Press, Cambridge, MA, 1971.
15. Gh. Paun, Five (plus two) universal DNA computing models based on the splicing operation, Second DNA Computing Workshop, Princeton, June 1996.
16. Gh. Paun, G. Rozenberg, A. Salomaa, Computing by splicing, Theoret. Comput. Sci. 168 (1996) 321-336.
17. Gh. Paun, A. Salomaa, DNA computing based on the splicing operation, Math. Japon. 43 (1996) 607-632.
18. D. Pixton, Regularity of splicing systems, Discrete Appl. Math. 69 (1996) 101-124.
19. D. Pixton, Splicing in abstract families of languages, Theoret. Comput. Sci., to appear.
20. L. Priese, Y. Rogojine, M. Morgenstern, Finite H-systems with 3 test tubes are not predictable, in: Proceedings of the Pacific Symposium on Biocomputing '98, World Scientific, Singapore, 1997, 547-558.
21. M.P. Schutzenberger, Sur certaines operations de fermeture dans les langages rationels, Sympos. Math. 15 (1975) 245-253.