Amounts of nondeterminism in finite automata
- 86 Downloads
The amount of nondeterminism in a nondeterministic finite automaton (NFA) is measured by counting the minimal number of “guessing points” a string w has to pass through on its way to an accepting state. NFA's with more nondeterminism can achieve greater savings in the number of states over their deterministic counterparts than NFA's with less nondeterminism. On the other hand, for some nontrivial infinite regular languages a deterministic finite automaton (DFA) can already be quite succinct in the sense that NFA's need as many states (and even context-free grammars need as many nonterminals) as the minimal DFA has states.
KeywordsInformation System Operating System Data Structure Communication Network Information Theory
Unable to display preview. Download preview PDF.
- 1.Kintala, C.M.R., Wotschke, D.: Amounts of Nondeterminism in Finite Automata, Pennsylvania State University,Technical Report CS78-11, 1978Google Scholar
- 2.Mańdl, R.: Precise Bounds Associated with Subset Construction of Various Classes of Nondeterministic Finite Automata, Princeton Conference on System Sciences, 1973Google Scholar
- 3.Meyer, A.R., Fischer, M.J.: Economics of Description by Automata, Grammars and Formal Systems, Proceedings of 12th SWAT Symposium, pp. 188–191, 1971Google Scholar