On the splicing operation

Discrete Applied Mathematics

Volumn 70, Issue 1, 1996, Pages 57-79

  Pǎun, Gheorghe ^a,b  

^a INSTITUTE OF MATHEMATICS   (Romania)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 13544264716     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(96)00101-1     Document Type: Article

References (22)

1. B. Brainerd, An analog of a theorem about context-free languages, Inform. Control 11 (1968) 561-567.
2. J. Collado-Vides, The search for a grammatical theory of gene regulation is formally justified by showing the inadequacy of context-free grammars, CABIOS, 7 (1991) 321-326.
3. K. Culik II and T. Harju, Splicing semigroups of dominoes and DNA, Discrete Appl. Math. 31 (1991) 261-277.
4. J. Dassow and Gh. Pǎun, Regulated Rewriting in Formal Language Theory (Springer, Berlin, 1989).
5. A. De Luca and A. Restivo, A characterization of strictly locally testable languages and its applications to subsemigroups of a free semigroup, Inform. Control 44 (1980) 300-319.
6. K.L. Denninghoff and R.W. Gatterdam, On the undecidability of splicing systems, Int. J. Comput. Math. 27 (1989) 133-145.
7. R.W. Gatterdam, Splicing systems and regularity, Int. J. Comput. Math. 31 (1989) 63-67.
8. R.W. Gatterdam, DNA and twist free splicing systems, in: M. Ito, H. Jürgensen, eds. Words, Languages, Combinatorics, II (World Scientific Publ., Singapore, 1994) 170-178.
9. S. Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages (North-Holland, Amsterdam, 1975).
10. J. Gruska, Descriptional complexity of context-free languages, Proc. MFCS Symp. (1973) 71-83.
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. T. Head, Splicing schemes and DNA, in G. Rozenberg, A. Salomaa, eds., Lindenmayer Systems; Impacts on Theoretical Computer Science and Developmental Biology (Springer-Verlag, Berlin, 1992) 371-383.
13. G.T. Herman, G. Rozenberg, Developmental Systems and Languages (North-Holland, Amsterdam, 1975).
14. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Reading, MA, 1979).
15. S. Marcus, Contextual grammars, Rev. Roum. Math. Pures Appl. 14 (1969) 1525-1534.
16. R. McNaughton and S. Papert, Counter-Free Automata (MIT Press, Cambridge, MA, 1971).
17. Gh. Pǎun, Contextual Grammars (Editura Academiei, Bucharest, 1982) (in Romanian).
18. D. Pixton, Regularity of splicing languages, manuscript, 1994.
19. G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems (Academic Press, New York, 1980).
20. A. Salomaa, On the index of context-free grammars and languages, Inform. Control 14 (1969) 474-477.
21. A. Salomaa, Formal Languages (Academic Press, New York, 1973).
22. D.B. Searls, The linguistics of DNA, Amer. Scientist 80 (1992) 579-591.