Linear splicing and syntactic monoid

DOI10.1016/J.DAM.2005.06.008zbMATH Open1095.68048OpenAlexW1993302096WikidataQ57518574 ScholiaQ57518574MaRDI QIDQ2489941FDOQ2489941

Authors: Paola Bonizzoni, Clelia De Felice, Rosalba Zizza, Giancarlo Mauri 

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.06.008

Recommendations

• Marked Systems and Circular Splicing
• A characterization of regular circular languages generated by marked splicing systems
• Deciding whether a regular language is generated by a splicing system
• Deciding whether a regular language is generated by a splicing system
• On the power of circular splicing

zbMATH Keywords

automatamolecular computingregular languagesmarker languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recognizing splicing languages: syntactic monoids and simultaneous pumping
• Splicing semigroups of dominoes and DNA
• The structure of reflexive regular splicing languages via Schützenberger constants
• On the splicing operation
• Regularity of splicing languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Circular splicing and regularity
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• Title not available (Why is that?)
• Computational Modeling for Genetic Splicing Systems

Cited In (7)

• The syntactic monoid of hairpin-free languages
• Circular splicing and regularity
• Marked Systems and Circular Splicing
• Regular splicing languages and subclasses
• Title not available (Why is that?)
• Constants and label-equivalence: 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: Linear splicing and syntactic monoid

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