Deciding whether a regular language is generated by a splicing system

DOI10.1016/J.JCSS.2016.10.001MaRDI QIDQ340586zbMATHOpenAlexFDO

Authors 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

regular languagedecidabilitysplicing systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Deciding whether a regular language is generated by a splicing system
• scientific article; zbMATH DE number 1953224
• Linear splicing and syntactic monoid
• scientific article; zbMATH DE number 2040901
• Regularity of splicing languages

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 3559875 (Why is no real title available?)
• scientific article; zbMATH DE number 1088281 (Why is no real title available?)
• scientific article; zbMATH DE number 1953224 (Why is no real title available?)
• A characterization of (regular) circular languages generated by monotone complete splicing systems
• Constants and label-equivalence: a decision procedure for reflexive regular splicing languages
• Deciding whether a regular language is generated by a splicing system
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• On the splicing operation
• Recent advances in formal languages and applications.
• Recognizing splicing languages: syntactic monoids and simultaneous pumping
• Regular Splicing Languages Must Have a Constant
• Regularity of splicing languages
• Separating some splicing models.
• Splicing semigroups of dominoes and DNA
• Splicing systems and regularity
• The structure of reflexive regular splicing languages via Schützenberger constants

Cited in

(12)

• scientific article; zbMATH DE number 2040901 (Why is no real title available?)
• Regular Splicing Languages Must Have a Constant
• Splicing systems and the Chomsky hierarchy
• State complexity of simple splicing
• Hybrid and generalized marked systems
• Universality of SNQ P systems using one type of spikes and restrictive rule application
• Existence of constants in regular splicing languages
• Linear splicing and syntactic monoid
• Theory of tailor automata
• Recognizing splicing languages: syntactic monoids and simultaneous pumping
• Deciding whether a regular language is generated by a splicing system
• scientific article; zbMATH DE number 4125033 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340586)