Unavoidable Sets, Prefix Graphs and Regularity of Circular Splicing Languages

DOI10.3233/FI-2020-1873zbMath1435.68146OpenAlexW2990192037MaRDI QIDQ5114209

Rosalba Zizza, Rocco Zaccagnino, Clelia De Felice, Paola Bonizzoni

Publication date: 21 June 2020

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2020-1873

zbMATH Keywords

formal languagesregular languagesunavoidable setscircular splicing languages

Mathematics Subject Classification ID

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

Related Items (1)

Hybrid and generalized marked systems

This page was built for publication: Unavoidable Sets, Prefix Graphs and Regularity of Circular Splicing Languages