Skip to main content
Log in

Amounts of nondeterminism in finite automata

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Kintala, C.M.R., Wotschke, D.: Amounts of Nondeterminism in Finite Automata, Pennsylvania State University,Technical Report CS78-11, 1978

  2. Mańdl, R.: Precise Bounds Associated with Subset Construction of Various Classes of Nondeterministic Finite Automata, Princeton Conference on System Sciences, 1973

  3. Meyer, A.R., Fischer, M.J.: Economics of Description by Automata, Grammars and Formal Systems, Proceedings of 12th SWAT Symposium, pp. 188–191, 1971

  4. Rabin, M.D., Scott, D.: Finite Automata and Decision Problems, IBM J. of Research and Development, 3, 114–125 (1959)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was supported in part by the National Science Foundation under Grant No. MCS 76-10076

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kintala, C.M.R., Wotschke, D. Amounts of nondeterminism in finite automata. Acta Informatica 13, 199–204 (1980). https://doi.org/10.1007/BF00263994

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00263994

Keywords

Navigation