Circular languages generated by complete splicing systems and pure unitary languages

zbMATH Open1456.68082MaRDI QIDQ5146649FDOQ5146649

Authors: Clelia De Felice, Rosalba Zizza, Paola Bonizzoni 

Publication date: 26 January 2021

Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCM2009.3

Recommendations

• A characterization of (regular) circular languages generated by monotone complete splicing systems
• On the power of circular splicing
• Unavoidable sets and circular splicing languages
• A characterization of regular circular languages generated by marked splicing systems
• Marked Systems and Circular Splicing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cited In (6)

• On the regularity of circular splicing languages: a survey and new developments
• Circular languages
• A characterization of (regular) circular languages generated by monotone complete splicing systems
• Unavoidable sets and circular splicing languages
• On the power of circular splicing
• Cyclic languages and strongly cyclic languages

This page was built for publication: Circular languages generated by complete splicing systems and pure unitary languages

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