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.
Articolo in rivista - Articolo scientifico
Splicing systems; formal languages; regular languages
English
1998
1
295
306
none
Bonizzoni, P., Ferretti, C., Mauri, G. (1998). Splicing systems with marked rules. ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY, 1, 295-306.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/2535
Citazioni
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
Social impact