Deciding whether a regular language is generated by a splicing system

DOI10.1016/j.jcss.2016.10.001zbMath1353.68167OpenAlexW1924404066MaRDI QIDQ340586

Lila Kari, Steffen Kopecki

Publication date: 14 November 2016

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2016.10.001

zbMATH Keywords

decidabilityregular languagesplicing systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Hybrid and generalized marked systems ⋮ Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application ⋮ Theory of tailor automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of (regular) circular languages generated by monotone complete splicing systems
• Constants and label-equivalence: a decision procedure for reflexive regular splicing languages
• 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
• Recent advances in formal languages and applications.
• Splicing systems and regularity
• Regular Splicing Languages Must Have a Constant
• Deciding Whether a Regular Language Is Generated by a Splicing System

This page was built for publication: Deciding whether a regular language is generated by a splicing system