SIAM Journal on Computing
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Communication complexity and parallel computing
Communication complexity and parallel computing
Handbook of formal languages, vol. 1
Translating regular expressions into small εe-free nondeterministic finite automata
Journal of Computer and System Sciences
A lower bound on the size of ɛ-free NFA corresponding to a regular expression
Information Processing Letters
Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Minimizing finite automata is computationally hard
Theoretical Computer Science - Developments in language theory
Unary language operations and their nondeterministic state complexity
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Extremal Combinatorics: With Applications in Computer Science
Extremal Combinatorics: With Applications in Computer Science
NFAs with and without ε-transitions
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Minimizing NFA's and regular expressions
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Finding lower bounds for nondeterministic state complexity is hard
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
On the average state and transition complexity of finite languages
Theoretical Computer Science
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
Lower bounds for the transition complexity of NFAs
Journal of Computer and System Sciences
Descriptional complexity of nondeterministic finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
On transition minimality of bideterministic automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
| Hi-index | 0.00 |
We construct regular languages Ln, n ≥1, such that any NFA recognizing Ln needs $\Omega( {\rm nsc}(L_n) \cdot \sqrt{{\rm nsc}(L_n)})$ transitions where nsc(Ln) is the nondeterministic state complexity of Ln. Also, we study trade-offs between the number of states and the number of transitions of an NFA. We show that adding one additional state can result in significant reductions in the number of transitions and that there exist regular languages Ln, n ≥2, where the transition minimal NFA for Ln has more than cnsc(Ln) states, for some constant c 1.