A characterization of (regular) circular languages generated by monotone complete splicing systems
From MaRDI portal
Publication:606981
DOI10.1016/j.tcs.2010.05.013zbMath1208.68133OpenAlexW2004389317WikidataQ62039445 ScholiaQ62039445MaRDI QIDQ606981
Clelia De Felice, Rosalba Zizza, Paola Bonizzoni
Publication date: 19 November 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.013
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Deciding whether a regular language is generated by a splicing system ⋮ Counting subwords in circular words and their Parikh matrices ⋮ 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
- Unnamed Item
- Well quasi-orders and context-free grammars
- On regularity of context-free languages
- Insertion languages
- 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
- 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 monotone complete splicing systems
