A Family of NFA's Which Need 2n -alpha Deterministic States

Authors:
Kazuo Iwama;Akihiro Matsuura;Mike Paterson
Affiliations:
-;-;-
Venue:
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Year:
2000

Citing 4
Cited 1

Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

IEEE Transactions on Computers
Finite automata and their decision problems

IBM Journal of Research and Development

Note on Minimal Finite Automata

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that for all integers n ≥ 7 and α, such that 5 ≤ α ≤ 2n - 2 and satisfying some coprimality conditions, there exists a minimum n-state nondeterministic finite automaton that is equivalent to a minimum deterministic finite automaton with exactly 2n-α states.