State complexity of finite partial languages
From MaRDI portal
Publication:2112191
DOI10.1007/978-3-031-13257-5_13OpenAlexW4300664875MaRDI QIDQ2112191
Matthias Wendlandt, Martin Kutrib
Publication date: 18 January 2023
Full work available at URL: https://doi.org/10.1007/978-3-031-13257-5_13
deterministic finite automatafinite languagesdeterminizationminimal automatapartial wordsoperational state complexityhierarchies on the number of unknown symbol transitions
Related Items
Cites Work
- A lower bound technique for the size of nondeterministic finite automata
- Regular languages of partial words
- A maxmin problem on finite automata
- Minimisation of acyclic deterministic automata in linear time
- Intersection and union of regular languages and state complexity
- Partial words and a theorem of Fine and Wilf
- State complexity of partial word finite automata
- On the state complexity of partial word DFAs
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
- Graph-Based Algorithms for Boolean Function Manipulation
- 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
- Minimal cover-automata for finite languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
