Unavoidable sets and circular splicing languages
From MaRDI portal
Publication:728277
DOI10.1016/j.tcs.2016.09.008zbMath1355.68155OpenAlexW2519899349MaRDI QIDQ728277
Rosalba Zizza, Clelia De Felice, Rocco Zaccagnino
Publication date: 19 December 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.008
Related Items (3)
Hybrid and generalized marked systems ⋮ Necklaces and bracelets in R ⋮ Ranking binary unlabelled necklaces in polynomial time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Splicing systems and the Chomsky hierarchy
- A characterization of (regular) circular languages generated by monotone complete splicing systems
- On regularity of context-free languages
- Insertion languages
- A characterization of regular circular languages generated by marked splicing systems
- On the power of circular splicing
- Circular splicing and regularity
- On the synchronizing properties of certain prefix codes
- Aspects of Molecular Computing
- Aspects of Molecular Computing
- On the regularity of circular splicing languages: a survey and new developments
This page was built for publication: Unavoidable sets and circular splicing languages
