Regular splicing languages and subclasses
From MaRDI portal
Publication:2484444
DOI10.1016/J.TCS.2005.03.035zbMATH Open1078.68075OpenAlexW2009900672WikidataQ57518592 ScholiaQ57518592MaRDI QIDQ2484444FDOQ2484444
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recognizing splicing languages: syntactic monoids and simultaneous pumping
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing the Order of a Locally Testable Automaton
- A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
- Linear splicing and syntactic monoid
- Title not available (Why is that?)
- Computational Modeling for Genetic Splicing Systems
- Title not available (Why is that?)
Cited In (15)
- Complexity theory for splicing systems
- Splicing Systems: Accepting Versus Generating
- 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
- Title not available (Why is that?)
- The structure of reflexive regular splicing languages via Schützenberger constants
- 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)
