DMCA
The Nondeterministic Complexity of a Finite Automaton (1990)
by
Imre Simon
| Citations: | 28 - 2 self |
BibTeX
@MISC{Simon90thenondeterministic,
author = {Imre Simon},
title = {The Nondeterministic Complexity of a Finite Automaton},
year = {1990}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We define the nondeterministic complexity of a finite automaton and show that there exist, for any integer p>=1, automata which need \Theta(k^{1/p}) nondeterministic transitions to spell words of length k. This leads to a subdivision of the family of recognizable M-subsets of a free monoid into a hierarchy whose members are indexed by polynomials, where M denotes the Min--Plus semiring.
