Splicing systems and regularity

International Journal of Computer Mathematics

Volumn 31, Issue 1-2, 1989, Pages 63-67

  Gatterdam, R W ^a  

^a UNIVERSITY OF ALASKA FAIRBANKS   (United States)

Author keywords

DNA; regular language; splicing system; strictly locally testable

Indexed keywords

EID: 0042507108     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207168908803788     Document Type: Article

References (5)

1. K. L. Denninghoff and R. W. Gatterdam, On the undecidability of splicing systems, Intern. J. Computer Maths. 27, (1989), 133–145.
2. R. W. Gatterdam, Algorithms for splicing systems, submitted.
3. T. Head, Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors, Bull. of Math. Biol. 49 (1987), 737–759.
4. J. E. Hoperoft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison Wesley, Reading, Mass., 1979.
5. R. McNaughton and S. Papert, Counter-free Automata, The M.I.T. Press, Cambridge, Mass., 1971.