Recognizing splicing languages: syntactic monoids and simultaneous pumping

DOI10.1016/j.dam.2006.10.006zbMath1115.68097OpenAlexW2000236593MaRDI QIDQ881578

Dennis Pixton, Elizabeth Goode

Publication date: 30 May 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.10.006

zbMATH Keywords

splicing systemsDNA splicingreflexive splicing languagessplicing languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Constants and label-equivalence: a decision procedure for reflexive regular splicing languages ⋮ Semigroup theory of symmetry ⋮ Deciding whether a regular language is generated by a splicing system ⋮ Conjugate word blending: formal model and experimental implementation by XPCR ⋮ Regular splicing languages and subclasses ⋮ Linear splicing and syntactic monoid ⋮ The structure of reflexive regular splicing languages via Schützenberger constants ⋮ A characterization of regular circular languages generated by marked splicing systems ⋮ Existence of constants in regular splicing languages

Cites Work

• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Splicing semigroups of dominoes and DNA
• Splicing in abstract families of languages
• Separating some splicing models.
• The structure of reflexive regular splicing languages via Schützenberger constants
• Regularity of splicing languages
• Splicing systems and regularity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recognizing splicing languages: syntactic monoids and simultaneous pumping