Dennis Pixton
Regularity of splicing languages. (3/6/95) (dvi or postscript or pdf)
A revised version appeared in Discrete Applied Math., 69 (1996), no. 1-2, 99-122.
We give automaton-based proofs of the regularity of splicing languages defined by finite splicing systems, and extend this to circular strings and to some non-finite but regular rule sets.