P. Bonizzoni, C. Ferretti, G. Mauri
Splicing systems with marked rules.
Abstract
This paper deals with two types of results about splicing systems.
First we try to give a new sufficient condition for a finite
automaton to generate a splicing language, based on the structure
of its transition graph. Second, the class of regular languages is
characterized in terms of splicing systems where rules are marked
at the leading or trailing end.
Both the results come from new insights about the relationships
between the properties of (non extended) splicing systems,
and finite state automata.