Regular Splicing Languages Must Have a Constant

DOI10.1007/978-3-642-22321-1_8MaRDI QIDQ5199955zbMATH OpenOpenAlexFDO

Authors Paola Bonizzoni, Nataşa Jonoska

Publication date 29 July 2011

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22321-1_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Existence of constants in regular splicing languages
• Regularity of splicing languages
• Regular splicing languages and subclasses
• The structure of reflexive regular splicing languages via Schützenberger constants
• Aspects of Molecular Computing
• Constants and label-equivalence: a decision procedure for reflexive regular splicing languages
• Deciding whether a regular language is generated by a splicing system
• Deciding whether a regular language is generated by a splicing system
• scientific article; zbMATH DE number 2013200
• scientific article; zbMATH DE number 1542862

Cited in

(2)

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

This page was built for publication: Regular Splicing Languages Must Have a Constant

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