Regular splicing languages and subclasses

DOI10.1016/j.tcs.2005.03.035zbMath1078.68075WikidataQ57518592 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

Automata; Regular languages; Molecular computing; Splicing systems

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

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

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