Non-Deterministic Finite Cover Automata

DOI10.7561/SACS.2015.1.3zbMath1424.68084OpenAlexW1993413705MaRDI QIDQ4621187

Cezar Campeanu

Publication date: 8 February 2019

Published in: Scientific Annals of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7561/sacs.2015.1.3

zbMATH Keywords

regular languagesfinite languagessimilarity relationcover automata\(l\)-cover automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

More on Deterministic and Nondeterministic Finite Cover Automata ⋮ Nondeterministic Tree Width of Regular Languages ⋮ More on deterministic and nondeterministic finite cover automata

This page was built for publication: Non-Deterministic Finite Cover Automata