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

DOI10.1016/J.TCS.2009.06.038MaRDI QIDQ847663zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The structure of reflexive regular splicing languages via Schützenberger constants
• A Decision Procedure for Reflexive Regular Splicing Languages
• Existence of constants in regular splicing languages
• scientific article; zbMATH DE number 2040901
• On the regularity of circular splicing languages: a survey and new developments
• scientific article; zbMATH DE number 1670715
• Aspects of Molecular Computing
• Regularity of splicing languages
• A complete refinement procedure for regular separability of context-free languages
• Recognizing splicing languages: syntactic monoids and simultaneous pumping

Cites work

• scientific article; zbMATH DE number 3559875 (Why is no real title available?)
• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 1142311 (Why is no real title available?)
• scientific article; zbMATH DE number 2040901 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• A Decision Procedure for Reflexive Regular Splicing Languages
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Linear splicing and syntactic monoid
• On the splicing operation
• Recognizing splicing languages: syntactic monoids and simultaneous pumping
• Regular splicing languages and subclasses
• Regularity of splicing languages
• Separating some splicing models.
• Splicing semigroups of dominoes and DNA
• The structure of reflexive regular splicing languages via Schützenberger constants

Cited in

(7)

• Existence of constants in regular splicing languages
• Regular splicing languages and subclasses
• Deciding whether a regular language is generated by a splicing system
• Regular Splicing Languages Must Have a Constant
• Recognizing splicing languages: syntactic monoids and simultaneous pumping
• A Decision Procedure for Reflexive Regular Splicing Languages
• The structure of reflexive regular splicing languages via Schützenberger constants

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

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