Constants and label-equivalence: a decision procedure for reflexive regular splicing languages

DOI10.1016/j.tcs.2009.06.038zbMath1193.68149OpenAlexW2080663279MaRDI QIDQ847663

Paola Bonizzoni

Publication date: 19 February 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.038

zbMATH Keywords

regular languagessplicing systemssyntactic monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Deciding whether a regular language is generated by a splicing system ⋮ Existence of constants in regular splicing languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Regular splicing languages and subclasses
• Linear splicing and syntactic monoid
• A Decision Procedure for Reflexive Regular Splicing Languages

This page was built for publication: Constants and label-equivalence: a decision procedure for reflexive regular splicing languages