论文信息 - Exponential Upper and Lower Bounds for the Order of a Regular Language

Exponential Upper and Lower Bounds for the Order of a Regular Language

The order of the language recognized by a nondeterministic finite automaton with n states is either infinite or at most 32n(n+1)−1. For each even n there is a deterministic finite automaton having n states and recognizing a language of order 2(n−2)2−1.

Andreas Weber | M. Weber

[1] Kosaburo Hashiguchi,et al. A Decision Procedure for the Order of Regular Events , 1979, Theor. Comput. Sci..

[2] Hing Leung. An algebraic method for solving decision problems in finite automata theory , 1987 .

[3] Imre Simon,et al. Limited subsets of a free monoid , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[4] Imre Simon,et al. On Semigroups of Matrices over the Tropical Semiring , 1994, RAIRO Theor. Informatics Appl..

[5] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[7] Kosaburo Hashiguchi,et al. Limitedness Theorem on Finite Automata with Distance Functions , 1982, J. Comput. Syst. Sci..

[8] Helmut Seidl,et al. On finitely generated monoids of matrices with entries in N , 1991, RAIRO Theor. Informatics Appl..

[9] Kosaburo Hashiguchi,et al. Improved Limitedness Theorems on Finite Automata with Distance Functions , 1990, Theor. Comput. Sci..

[10] Andreas Weber. Finite-Valued Distance Automata , 1994, Theor. Comput. Sci..

[11] Philippe Gohon. Automates de Coût Borné Sur Un Alphabet A Une Lettre , 1985, RAIRO Theor. Informatics Appl..

[12] Arto Salomaa. Jewels of formal language theory , 1981 .