Computing by splicing

Theoretical Computer Science

Volumn 168, Issue 2, 1996, Pages 321-336

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

^a INSTITUTE OF MATHEMATICS   (Romania)

^b LEIDEN UNIVERSITY   (Netherlands)

^c UCB 450   (United States)

^d UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; CONTEXT FREE LANGUAGES;

RECURSIVELY ENUMERABLE LANGUAGES; SPLICING SYSTEMS;

COMPUTATION THEORY;

EID: 0030291381     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00082-5     Document Type: Article

References (16)

1. 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.
2. K. Culik II and T. Harju, Splicing semigroups of dominoes and DNA, Discrete Appl. Math. 31 (1991) 261-277.
3. J. Dassow and Gh. Pǎun, Regulated Rewriting in Formal Language Theory (Springer, Berlin, 1989).
4. K.L. Denninghoff and R.W. Gatterdam, On the undecidability of splicing systems, Int. J. Comput. Math. 27 (1989) 133-145.
5. R.W. Gatterdam, Splicing systems and regularity, Int. J. Comput. Math. 31 (1989) 63-67.
6. T. Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biology 49 (1987) 737-759.
7. T. Head, Splicing schemes and DNA, in: G. Rozenberg and A. Salomaa, eds., Lindenmayer Systems; Impacts on Theoretical Computer Science and Developmental Biology (Springer, Berlin, 1992) 371-383.
8. L. Ilie and V. Mitrana, Crossing-over on languages. A formal representation of the recombination of genes in a chromosome, submitted, 1995.
9. M. Latteux, B. Leguy and B. Ratoandromanana, The family of one-counter languages is closed under quotient, Acta Inform. 22 (1985) 579-588.
10. A. Mateescu, Gh. Pǎun, G. Rozenberg and A. Salomaa, Simple splicing systems, Discrete Appl. Math., to appear.
11. Gh. Pǎun, On the power of the splicing operation, Int. J. Comput. Math. 59 (1995) 27-35.
12. Gh. Pǎun, On the splicing operation, Discrete Appl. Math. 70 (1996) 57-79.
13. Gh. Pǎun and G. Rozenberg, Contextual grammars, in: G. Rozenberg and A. Salomaa, eds., The Handbook of Formal Languages (Springer, Berlin, 1996).
14. D. Pixton, Linear and circular splicing systems, in: 1st IEEE Symp. Intelligence in Neural and Biological Systems, Washington (1995) 181-188.
15. D. Pixton, Context-free splicing systems, manuscript, 1995.
16. A. Salomaa, Formal Languages (Academic Press, New York, 1973).