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 whose rules are marked at the leading or trailng end. Both results come from new insights about the relationships between the properties of (non extended) splicing systems, and finite state automata.
Bonizzoni, P., Ferretti, C., Mauri, G. (1998). Splicing systems with marked rules. ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY, 1, 295-306.
Splicing systems with marked rules
BONIZZONI, PAOLA;FERRETTI, CLAUDIO;MAURI, GIANCARLO
1998
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 whose rules are marked at the leading or trailng end. Both results come from new insights about the relationships between the properties of (non extended) splicing systems, and finite state automata.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
