|
|||||
|
|
Splicing systems and regularity |
|
| 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: | DNA regular language splicing system strictly locally testable |