Circular splicing and regularity

DOI10.1051/ita:2004010zbMath1082.68048OpenAlexW2137842717WikidataQ57518597 ScholiaQ57518597MaRDI QIDQ4825394

Clelia De Felice, Rosalba Zizza, Giancarlo Mauri, Paola Bonizzoni

Publication date: 28 October 2004

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2004__38_3_189_0

zbMATH Keywords

weak cyclic languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (7)

A characterization of (regular) circular languages generated by monotone complete splicing systems ⋮ Hybrid and generalized marked systems ⋮ Linear splicing and syntactic monoid ⋮ Unavoidable sets and circular splicing languages ⋮ On the regularity of circular splicing languages: a survey and new developments ⋮ A characterization of regular circular languages generated by marked splicing systems ⋮ On the power of circular splicing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Splicing semigroups of dominoes and DNA
• Separating some splicing models.
• The structure of reflexive regular splicing languages via Schützenberger constants
• On the splicing operation
• Regularity of splicing languages
• Linear splicing and syntactic monoid
• On the power of circular splicing
• Splicing systems and regularity
• Algorithms for Splicing Systems
• Reflective star languages and codes
• Computational Modeling for Genetic Splicing Systems

This page was built for publication: Circular splicing and regularity