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
- 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
- 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?)
- 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)- Splicing in abstract families of languages
- 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
- An algebraic characterization of semi-simple splicing
- A Decision Procedure for Reflexive Regular Splicing Languages
- Non-preserving accepting splicing systems
- Regular Splicing Languages Must Have a Constant
- Constants and label-equivalence: a decision procedure for reflexive regular splicing languages
- Recognizing splicing languages: syntactic monoids and simultaneous pumping
- Accepting splicing systems
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)
