Regular splicing languages and subclasses

DOI10.1016/J.TCS.2005.03.035MaRDI QIDQ2484444zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• The structure of reflexive regular splicing languages via Schützenberger constants
• scientific article; zbMATH DE number 1953224
• scientific article; zbMATH DE number 2040901
• A Decision Procedure for Reflexive Regular Splicing Languages
• Constants and label-equivalence: a decision procedure for reflexive regular splicing languages

Cites work

• scientific article; zbMATH DE number 4037246 (Why is no real title available?)
• scientific article; zbMATH DE number 3559875 (Why is no real title available?)
• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 1142311 (Why is no real title available?)
• scientific article; zbMATH DE number 1948488 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• scientific article; zbMATH DE number 2040901 (Why is no real title available?)
• scientific article; zbMATH DE number 2051176 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• Computational Modeling for Genetic Splicing Systems
• Computing the Order of a Locally Testable Automaton
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Linear splicing and syntactic monoid
• On the splicing operation
• Recognizing splicing languages: syntactic monoids and simultaneous pumping
• Regularity of splicing languages
• Separating some splicing models.
• Splicing semigroups of dominoes and DNA
• The structure of reflexive regular splicing languages via Schützenberger constants

Cited in

(15)

• Complexity theory for splicing systems
• Non-preserving accepting splicing systems
• Accepting splicing systems
• Hybrid and generalized marked systems
• Existence of constants in regular splicing languages
• An algebraic characterization of semi-simple splicing
• Accepting splicing systems with permitting and forbidding words
• Splicing in abstract families of languages
• Regular Splicing Languages Must Have a Constant
• Recognizing splicing languages: syntactic monoids and simultaneous pumping
• Constants and label-equivalence: a decision procedure for reflexive regular splicing languages
• A Decision Procedure for Reflexive Regular Splicing Languages
• The structure of reflexive regular splicing languages via Schützenberger constants
• Splicing systems: accepting versus generating
• An alternative definition of splicing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484444)