Abstract
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.
This research is supported by an Alexander von Humboldt research fellowship.
The author is currently on leave from the Department of Computer Science, New Mexico State University, NM 88003, U.S.A.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
Goldstine J., Kintala C.M.R. and Wotschke D., On Measuring Nondeterminism in Regular Languages, Information and Computation 86, No. 2, 179–194, 1990.
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.
Hashiguchi K., Limitedness Theorem on Finite Automata with Distance Functions, Journal of Computer and System Sciences 24, No. 2, 233–244, 1982.
Hashiguchi K., Improved Limitedness Theorem on Finite Automata with Distance Functions, Theoretical Computer Science 72, 27–38, 1990.
Kintala C.M.R. and Wotschke D., Amount of Nondeterminism in Finite Automata, Acta Informatica 13, 199–204, 1980.
Leung H., On the Topological Structure of a Finitely Generated Semigroup of Matrices, Semigroup Forum 37, 273–287, 1988.
Leung H., Limitedness Theorem on Finite Automata with Distance Functions: an Algebraic Proof, Theoretical Computer Science 81, 137–145, 1991.
Meyer A. and Fischer M., Economy of Description by Automata, Grammars, and Formal Systems, Proc. 12th SWAT Symposium, 188–191, 1971.
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.
Simon I., Recognizable Sets with Multiplicities in the Tropical Semiring, Proc. MFCS 1988, Lecture Notes in Computer Science 324, Springer-Verlag, 107–120, 1988.
Simon I., On Semigroups of Matrices over the Tropical Semiring, Technical Report RT-MAC-8907, Universidade de Sāo Paulo, 1989.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leung, H. (1992). On finite automata with limited nondeterminism (extended abstract). In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_34
Download citation
DOI: https://doi.org/10.1007/3-540-55808-X_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55808-8
Online ISBN: 978-3-540-47291-9
eBook Packages: Springer Book Archive