Regularity of splicing languages

Discrete Applied Mathematics

Volumn 69, Issue 1-2, 1996, Pages 101-124

  Pixton, Dennis ^a  

^a BINGHAMTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000262403     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00079-7     Document Type: Article

References (8)

1. K. Culik II and T. Harju, Splicing semigroups of dominoes and DNA, Discrete Appl. Math. 31 (1991) 261-277.
2. R.W. Gatterdam, DNA and twist free splicing systems, in: M. Ito and H. Jurgensen, eds., Words Languages and Combinatorics II (World Scientific, Singapore, 1994), 170-178.
3. Tom Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biol. 49 (1987) 737-759.
4. Tom Head, Splicing schemes and DNA, in: G. Rozenberg and A. Salomaa, eds., Lindenmayer Systems - Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology (Springer, Berlin, 1992) 371-383.
5. G. Pǎun, On the splicing operation, Discrete Appl. Math. 70 (1996) to appear.
6. R. Siromoney, K.G. Subramanian, and V.R. Dare, Circular DNA and splicing systems, in: Parallel Image Analysis, Lecture Notes in Computer Science, Vol. 654 (Springer, Berlin, 1992) 260-273.
7. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computing, Addison-Wesley, Reading, Mass., 1979.
8. G. Pǎun, Regular extended H systems are computationally universal, submitted, 1995.