Finite automata and unary languages
Theoretical Computer Science
Communication complexity and parallel computing
Communication complexity and parallel computing
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs
Theoretical Computer Science
A Family of NFA's Which Need 2n -alpha Deterministic States
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Finite automata and their decision problems
IBM Journal of Research and Development
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the State Complexity of Complements, Stars, and Reversals of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Concatenation of Regular Languages and Descriptional Complexity
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
State complexity of projected languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Magic numbers in the state hierarchy of finite automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On a structural property in the state complexity of projected regular languages
Theoretical Computer Science
| Hi-index | 0.00 |
We show that for all n and α such that 1 ≤ n ≤ α ≤ 2n there is a minimal n-state nondeterministic finite automaton whose equivalent minimal deterministic automaton has exactly α states.