On finite automata with limited nondeterminism

Acta Informatica

Volumn 35, Issue 7, 1998, Pages 595-624

  Leung, Hing ^a  

^a New Mexico State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032335724     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050133     Document Type: Article

References (20)

1. Aho A., Hopcroft J., Ullman J.: The design and analysis of computer algorithms. Reading, MA: Addison-Wesley 1974
2. Gohon P.: Automates de coût borné sur un alphabet à une lettre. RAIRO ITA 19, 351-357 (1985)
3. Garey M.R., Johnson D.S.: Computers and intractability. San Francisco, CA: Freeman 1979
4. Goldstine J., Kintala C.M.R., Wotschke D.: On measuring nondeterminism in regular languages. Inform. Comput. 86, 179-194 (1990)
5. Goldstine J., Leung H., Wotschke D.: On the relation between ambiguity and nondeterminism in finite automata. Inform. Comput. 100, 261-270 (1992)
6. Hashiguchi K.: Limitedness theorem on finite automata with distance functions. J. Comput. Syst. Sci. 24, 233-244 (1982)
7. Hashiguchi K.: Improved limitedness theorem on finite automata with distance functions. Theor. Comput. Sci. 72, 27-38 (1990)
8. Hashiguchi K.: New upper bounds to the limitedness of distance automata. Proc. ICALP 1996. (Lect. Notes Comput. Sci., vol. 1099, pp. 324-335) Berlin Heidelberg New York: Springer 1996
9. Hopcroft J., Ullman J.: Introduction to automata theory, languages and computation. Reading, MA: Addison-Wesley 1974
10. Kintala C.M.R., Wotschke D.: Amount of nondeterminism in finite automata. Acta Inf. 13, 199-204 (1980)
11. Leung H.: On the topological structure of a finitely generated semigroup of matrices. Semigroup Forum 37, 273-287 (1988)
12. Leung H.: Limitedness theorem on finite automata with distance functions: an algebraic proof. Theor. Comput. Sci. 81, 137-145 (1991)
13. Leung H.: On finite automata with limited nondeterminism. Proc. MFCS 1992. (Lect. Notes Comput. Sci., vol. 629, pp. 355-363) Berlin Heidelberg New York: Springer 1992
14. Meyer A., Fischer M.: Economy of description by automata, grammars, and formal systems. Proc. 12th SWAT Symposium, 188-191 (1971)
15. Moore F.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Trans. Comput. 20, 1211-1214 (1971)
16. Simon I.: The nondeterministic complexity of a finite automaton. In: M. Lothaire (ed.) Mots - mélanges offerts à M. P. Schützenberger. (pp. 384-400) Paris: Hermes 1990
17. Simon I.: Recognizable sets with multiplicities in the tropical semiring. Proc. MFCS 1988. (Lect. Notes Comput. Sci., vol. 324, pp. 107-120) Berlin Heidelberg New York: Springer 1988
18. Simon I.: On semigroups of matrices over the tropical semiring. RAIRO ITA 28, 277-294 (1994)
19. Weber A.: Distance automata having large finite distance or finite ambiguity. Math. Syst. Theory 26, 169-185 (1993)
20. Weber A.: Finite-valued distance automata. Theor. Comput. Sci. 134, 225-251 (1994)