论文信息 - Minimal Forbidden Words and Symbolic Dynamics

Minimal Forbidden Words and Symbolic Dynamics

We introduce a new complexity measure of a factorial formal language L: the growth rate of the set of minimal forbidden words. We prove some combinatorial properties of minimal forbidden words. As main result we prove that the growth rate of the set of minimal forbidden words for L is a topological invariant of the dynamical system defined by L.

[1] Harold Marston Morse. Recurrent geodesics on a surface of negative curvature , 1921 .

[2] R. McNaughton,et al. Counter-Free Automata , 1971 .

[3] R. F. Williams. Errata to "Classification of Subshifts of Finite Type" , 1974 .

[4] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[5] M. Hassner,et al. Algorithms for sliding block codes - An application of symbolic dynamics to information theory , 1983, IEEE Trans. Inf. Theory.

[6] Maurice Nivat,et al. Automata on Infinite Words , 1985, Lecture Notes in Computer Science.

[7] G. Rauzy,et al. Mots infinis en arithmétique , 1984, Automata on Infinite Words.

[8] Jean Berstel,et al. Fibonacci Words — A Survey , 1986 .

[9] Grzegorz Rozenberg,et al. The Book of L , 1986, Springer Berlin Heidelberg.

[10] R. Badii. Quantitative characterization of complexity and predictability , 1991 .

[11] T. Bountis. Chaotic dynamics : theory and practice , 1992 .

[12] R. Badii,et al. Complexity and Unpredictable Scaling of Hierarchical Structures , 1992 .

[13] Fred W. Roush,et al. Williams’s conjecture is false for reducible subshifts , 1992 .

[14] Filippo Mignosi,et al. Some Combinatorial Properties of Sturmian Words , 1994, Theor. Comput. Sci..

[15] Aldo de Luca,et al. On Bispecial Factors of the Thue-Morse Word , 1994, Inf. Process. Lett..

[16] M. Lothaire. Combinatorics on words: Bibliography , 1997 .