Non-deterministic finite cover automata

DOI10.7561/SACS.2015.1.3zbMATH Open1424.68084OpenAlexW1993413705MaRDI QIDQ4621187FDOQ4621187

C. Câmpeanu

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

Recommendations

• Derived-term automata of multitape expressions with composition
• Derived-term automata of multitape rational expressions
• LATIN 2004: Theoretical Informatics
• How expressions can code for automata
• Derived-term automata for extended weighted rational expressions

zbMATH Keywords

regular languagessimilarity relationfinite languagescover automata\(l\)-cover automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (6)

• Nondeterministic Tree Width of Regular Languages
• More on deterministic and nondeterministic finite cover automata
• More on Deterministic and Nondeterministic Finite Cover Automata
• Run-Length Encoded Nondeterministic KMP and Suffix Automata
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
• Finitely nonstationary nondeterministic automata with random input

This page was built for publication: Non-deterministic finite cover automata

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