Restricted use of the splicing operation1

International Journal of Computer Mathematics

Volumn 60, Issue 1-2, 1996, Pages 17-32

  Pǎun, Gheorghe ^a   Rozenberg, Grzegorz ^b,c   Salomaa, Arto ^d  

^a INSTITUTE OF MATHEMATICS   (Romania)

^b LEIDEN UNIVERSITY   (Netherlands)

^c University of Colorado at Boulder   (United States)

^d UNIVERSITY OF TURKU   (Finland)

Author keywords

Abstract families of languages; Chomsky hierarcky; DNA recombination; Molecular genetics; Regulated rewriting; Splicing systems

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL GRAMMARS; COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; CONTEXT FREE LANGUAGES;

ABSTRACT FAMILIES OF LANGUAGES; CHOMSKY HIERARCHY; LANGUAGE THEORY; MOLECULAR GENETICS; REGULATED REWRITING; SPLICING SYSTEMS;

COMPUTATIONAL METHODS;

EID: 0029736332     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169608804472     Document Type: Article

References (22)

1. B. S. Baker, R. V. Book, Reversal-bounded multipushdown machines, J. Comput. Systems Sci., 8 (1974), 315-332.
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, T. Harju, Splicing semigroups of dominoes and DNA, Discrete Appl. Math., 31 (1991), 261-277.
4. J. Dassow, Gh. Pǎun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, Heidelberg, New York, 1989.
5. K. L. Denninghoff, R. W. Gatterdam, On the undecidability of splicing systems, Intern. J. Computer Math., 27 (1989), 133-145.
6. R. W. Gatterdam, Splicing systems and regularity, Intern. J. Computer Math., 31 (1989), 63-67.
7. S. Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975.
8. T. Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biology, 49 (1987), 737-759.
9. T. Head, Splicing schemes and DNA, in Lindenmayer Systems; Impacts on Theoretical Computer Science and Developmental Biology (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, Berlin, 1992, 371-383.
10. O. Ibarra, Simple matrix grammars, Inform. Control, 17 (1970), 359-394.
11. M. Latteux, B. Leguy, B. Ratoandromanana, The family of one-counter languages is closed under quotient, Acta Informatica, 22 (1985), 579-588.
12. A. Mateescu, Gh. Pǎun, G. Rozenberg, A. Salomaa, Simple splicing systems, submitted, 1995.
13. V. Mitrana, Crossover systems: a language-theoretic approach to DNA recombinations, manuscript, 1995.
14. Gh. Pǎun, On the splicing operation, Discrete Appl. Math., to appear.
15. Gh. Pǎun, On the power of the splicing operation, Intern. J Computer Math., to appear.
16. Gh. Pǎun, G. Rozenberg, A. Salomaa, Computing by splicing, submitted, 1995.
17. Gh. Pǎun, A. Salomaa, Thin and slender languages, Discrete Appl. Math., 61 (1995), 257-270.
18. D. Pixton, Linear and circular splicing systems, First IEEE Symp. Intelligence in Neural and Biological Systems, Washington, (1995), 181-188.
19. D. Pixton, Context-free splicing systems, manuscript, 1994.
20. G. Rozenberg, A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1980.
21. G. Rozenberg, A. Salomaa (eds.), The Handbook of Formal Languages, in preparation.
22. A. Salomaa, Formal Languages, Academic Press, New York, 1973.