State complexity of partial word finite automata

DOI10.1007/978-3-030-93489-7_10OpenAlexW4206363802MaRDI QIDQ2096588

Matthias Wendlandt, Martin Kutrib

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93489-7_10

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Lyndon partial words and arrays with applications, State complexity of finite partial languages, State complexity of finite partial languages

Cites Work

• A lower bound technique for the size of nondeterministic finite automata
• Regular languages of partial words
• On measuring nondeterminism in regular languages
• Intersection and union of regular languages and state complexity
• Partial words and a theorem of Fine and Wilf
• On the state complexity of partial word DFAs
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
• On the Computational Complexity of Partial Word Automata Problems
• Minimal partial languages and automata
• Algorithmic Combinatorics on Partial Words
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
• Unnamed Item