Abstract.
This paper deals with two types of results about splicing systems. First, we 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 whose rules are marked at one of their ends. Both the results come from new insights on the relationships between the properties of (non-extended) splicing systems and finite state automata