Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. 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.
2. Goldstine J., Kintala C.M.R. and Wotschke D., On Measuring Nondeterminism in Regular Languages, Information and Computation
86, No. 2, 179–194, 1990.
3. 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.
4. Hashiguchi K., Limitedness Theorem on Finite Automata with Distance Functions, Journal of Computer and System Sciences
24, No. 2, 233–244, 1982.
5. Hashiguchi K., Improved Limitedness Theorem on Finite Automata with Distance Functions, Theoretical Computer Science
72, 27–38, 1990.