On the regularity of circular splicing languages: a survey and new developments

DOI10.1007/s11047-009-9155-7zbMath1207.68182OpenAlexW2057026370WikidataQ62039447 ScholiaQ62039447MaRDI QIDQ5962067

Paola Bonizzoni, Gabriele Fici, Clelia De Felice, Rosalba Zizza

Publication date: 16 September 2010

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-009-9155-7

zbMATH Keywords

automata theorygraph 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 ⋮ A characterization of regular circular languages generated by marked splicing systems

Cites Work

• A characterization of (regular) circular languages generated by monotone complete splicing systems
• A characterization of regular circular languages generated by marked splicing systems
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Simple splicing systems
• Splicing in abstract families of languages
• Computing with membranes
• Regularity of splicing languages
• On the power of circular splicing
• Reflective star languages and codes
• Circular splicing and regularity
• Marked Systems and Circular Splicing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the regularity of circular splicing languages: a survey and new developments