Linear splicing and syntactic monoid

DOI10.1016/j.dam.2005.06.008zbMath1095.68048OpenAlexW1993302096WikidataQ57518574 ScholiaQ57518574MaRDI QIDQ2489941

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

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.06.008

zbMATH Keywords

automataregular languagesmolecular computingmarker languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Constants and label-equivalence: a decision procedure for reflexive regular splicing languages ⋮ The syntactic monoid of hairpin-free languages ⋮ Circular splicing and regularity ⋮ Regular splicing languages and subclasses ⋮ The structure of reflexive regular splicing languages via Schützenberger constants

Cites Work

• Recognizing splicing languages: syntactic monoids and simultaneous pumping
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Splicing semigroups of dominoes and DNA
• The structure of reflexive regular splicing languages via Schützenberger constants
• On the splicing operation
• Regularity of splicing languages
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• Computational Modeling for Genetic Splicing Systems
• Circular splicing and regularity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear splicing and syntactic monoid