Splicing systems and regularity
- 1 January 1989
- journal article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 31 (1-2) , 63-67
- https://doi.org/10.1080/00207168908803788
Abstract
A direct and constructive proof is given that every regular language is the homomorphic image of a splicing language as defined by Head. The class of splicing languages involved have a particularly simple presentation and are regular. Also presented are some examples which demonstrate the relation of the class of splicing languages to that of regular languages and an example of a regular language which is not a splicing language.Keywords
This publication has 2 references indexed in Scilit:
- On the undecidability of splicing systemsInternational Journal of Computer Mathematics, 1989
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviorsBulletin of Mathematical Biology, 1987