Regular splicing languages and subclasses

DOI10.1016/j.tcs.2005.03.035zbMath1078.68075OpenAlexW2009900672WikidataQ57518592 ScholiaQ57518592MaRDI QIDQ2484444

Paola Bonizzoni, Giancarlo Mauri

Publication date: 1 August 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.035

zbMATH Keywords

AutomataRegular languagesMolecular computingSplicing systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Accepting splicing systems with permitting and forbidding words ⋮ Constants and label-equivalence: a decision procedure for reflexive regular splicing languages ⋮ Complexity theory for splicing systems ⋮ Hybrid and generalized marked systems ⋮ Unnamed Item ⋮ Accepting splicing systems ⋮ The structure of reflexive regular splicing languages via Schützenberger constants ⋮ An alternative definition of splicing ⋮ Splicing Systems: Accepting Versus Generating ⋮ Existence of constants in regular splicing languages

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
• 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
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• Computing the Order of a Locally Testable Automaton
• Computational Modeling for Genetic Splicing Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular splicing languages and subclasses