On the complexity of multi-entry DFAs
From MaRDI portal
Cites work
- A lower bound technique for the size of nondeterministic finite automata
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity
- Descriptional and computational complexity of finite automata -- a survey
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1962776 (Why is no real title available?)
- scientific article; zbMATH DE number 1502109 (Why is no real title available?)
- scientific article; zbMATH DE number 1747444 (Why is no real title available?)
- scientific article; zbMATH DE number 3241282 (Why is no real title available?)
- scientific article; zbMATH DE number 3255742 (Why is no real title available?)
- In Search of Most Complex Regular Languages
- Intersection and union of regular languages and state complexity
- Minimizing finite automata is computationally hard
- Multi-entry DFA with reduced initial states to speedup parallel recognition
- Multiple-entry finite automata
- On NFAs where all states are final, initial, or both
- On the state complexity of reversals of regular languages
- Partial orders on words, minimal elements of regular languages, and state complexity
- Quotient complexity of closed languages
- State complexity of some operations on binary regular languages
- Structurally Unambiguous Finite Automata
- Sur les fonctions définies dans les ensembles finis quelconques.
- The state complexities of some basic operations on regular languages
This page was built for publication: On the complexity of multi-entry DFAs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7412095)
