A characterization of regular circular languages generated by marked splicing systems

DOI10.1016/j.tcs.2009.07.005zbMath1194.68150OpenAlexW2054439084WikidataQ62039449 ScholiaQ62039449MaRDI QIDQ1034615

Gabriele Fici, Rosalba Zizza, Clelia De Felice

Publication date: 6 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.005

zbMATH Keywords

automata theoryformal languagesmolecular computingcircular wordssplicing systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

A characterization of (regular) circular languages generated by monotone complete splicing systems ⋮ Splicing systems and the Chomsky hierarchy ⋮ Hybrid and generalized marked systems ⋮ Unavoidable sets and circular splicing languages ⋮ On the regularity of circular splicing languages: a survey and new developments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recognizing splicing languages: syntactic monoids and simultaneous pumping
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Simple splicing systems
• Splicing in abstract families of languages
• The structure of reflexive regular splicing languages via Schützenberger constants
• On the splicing operation
• Regularity of splicing languages
• On the power of circular splicing
• Circular splicing and regularity
• Marked Systems and Circular Splicing
• Aspects of Molecular Computing
• On the regularity of circular splicing languages: a survey and new developments

This page was built for publication: A characterization of regular circular languages generated by marked splicing systems