On finite automata with limited nondeterminism (extended abstract)

  • Hing Leung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 629)


We develop a new algorithm for determining if a given nondeterministic finite automaton is limited in nondeterminism. From this, we show that the number of nondeterministic moves of a finite automaton, if limited, is bounded by 2n−2 where n is the number of states. If the finite automaton is over a one letter alphabet, using Gohon's result the number of nondeterministic moves, if limited, is less than n 2. In both cases, we present families of finite automata demonstrating that the upper bounds obtained are almost tight.


Distance Function Regular Language Finite Automaton Letter Alphabet Deterministic Finite Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Go85]
    Gohon P., Automates de coût borné sur un alphabet a une lettre, R.A.I.R.O. Informatique théorique 19, No. 4, 351–357, 1985.zbMATHMathSciNetGoogle Scholar
  2. [GKW90]
    Goldstine J., Kintala C.M.R. and Wotschke D., On Measuring Nondeterminism in Regular Languages, Information and Computation 86, No. 2, 179–194, 1990.zbMATHMathSciNetCrossRefGoogle Scholar
  3. [GLW89]
    Goldstine J., Leung H. and Wotschke D., On the Relation between Ambiguity and Nondeterminism in Finite Automata, Computer Science Technical Report CS-89-19, The Pennsylvania State University, University Park, Pennsylvania; Information and Computation, to appear.Google Scholar
  4. [H82]
    Hashiguchi K., Limitedness Theorem on Finite Automata with Distance Functions, Journal of Computer and System Sciences 24, No. 2, 233–244, 1982.zbMATHMathSciNetCrossRefGoogle Scholar
  5. [H90]
    Hashiguchi K., Improved Limitedness Theorem on Finite Automata with Distance Functions, Theoretical Computer Science 72, 27–38, 1990.zbMATHMathSciNetCrossRefGoogle Scholar
  6. [KW80]
    Kintala C.M.R. and Wotschke D., Amount of Nondeterminism in Finite Automata, Acta Informatica 13, 199–204, 1980.zbMATHMathSciNetCrossRefGoogle Scholar
  7. [L88]
    Leung H., On the Topological Structure of a Finitely Generated Semigroup of Matrices, Semigroup Forum 37, 273–287, 1988.zbMATHMathSciNetGoogle Scholar
  8. [L91]
    Leung H., Limitedness Theorem on Finite Automata with Distance Functions: an Algebraic Proof, Theoretical Computer Science 81, 137–145, 1991.zbMATHMathSciNetCrossRefGoogle Scholar
  9. [MF71]
    Meyer A. and Fischer M., Economy of Description by Automata, Grammars, and Formal Systems, Proc. 12th SWAT Symposium, 188–191, 1971.Google Scholar
  10. [S87]
    Simon I., The Nondeterministic Complexity of a Finite Automaton, in M. Lothaire(ed.), Mots — mélanges offerts à M. P. Schützenberger, Hermes, Paris, 384–400, 1990.Google Scholar
  11. [S88]
    Simon I., Recognizable Sets with Multiplicities in the Tropical Semiring, Proc. MFCS 1988, Lecture Notes in Computer Science 324, Springer-Verlag, 107–120, 1988.Google Scholar
  12. [S89]
    Simon I., On Semigroups of Matrices over the Tropical Semiring, Technical Report RT-MAC-8907, Universidade de Sāo Paulo, 1989.Google Scholar
  13. [W90]
    Weber A., Distance Automata having Large Finite Distance or Finite Ambiguity, Proc. MFCS 1990, Lecture Notes in Computer Science 452, Springer-Verlag, 508–515, 1990; Mathematical System Theory, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Hing Leung
    • 1
  1. 1.Fachbereich Informatik, J.W. Goethe-UniversitätFrankfurt am Main 11Germany

Personalised recommendations