Abstract
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.
Classification
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. Adler, D. Coppersmith, M. Hassner. Algorithms for Sliding-Block Codes, IEEE Trans. Inf. Theory, IT-29 (1983), 5–22.
R. Badii. Quantitave Characterization of Complexity and Predictability, Physics Letters A 160 (1991), 372–377.
R. Badii. Complexity and Unpredictable Scaling of Hierarchical Structures, in “Chaotic Dynamics: Theory and Practice”, T. Bountis Ed., Plenum Press, New York, 1992.
M. P. Béal. Codage Symbolique, Masson, 1993.
J. Berstel. Fibonacci Words — a Survey, in “The Book of L”, G. Rozenberg, A. Salomaa eds., Springer Verlag 1986.
J. Cassaigne. Complexité et Facteurs Spéciaux, Actes des Journées Montoises, 1994.
A. de Luca, F. Mignosi. Some Combinatorial Properties of Sturmian Words, Theor. Comp. Science, 136 (1994), 361–385.
A. de Luca, L. Mione. On Bispecial Factors of the Thue-Morse Word, Inf. Proc. Lett., 49 (1994), 179–183.
S. Eilenberg. Automata, Languages, Machines, Vol. A, Academic Press, 1974.
G. A. Hedlund. Endomorphisms and Autorphisms of the Shift Dynamical System, Math. System Theory, 3 (1969), 320–375.
K. H. Kim, F. W. Roush. Williams Conjecture is False for Reducible Matrices, J. Amer. Math. Soc. 5 (1992), 213–125.
M. Lothaire. Combinatorics on Words, Addison-Wesley, Reading, MA 1983.
H. A. Maurer, M. Nivat. Rational bijections of rational sets, Acta Informatica 13 (1980), 365–378.
R. McNaughton, S. Papert. Counter-Free Automata, M.I.T. Press, MA 1970.
M. Morse. Recurrent geodesics on a surface of negative curvature, Trans. Amer. Math. Soc. 22 (1921), 84–110.
D. Perrin. Symbolic Dynamics and Finite Automata, invited lecture in Proc. MFCS'95, Lect. Notes in Comp. Sci., 969.
G. Rauzy, Mots infinis en arithmétique in “Automata on Infinite words”, M. Nivat and D. Perrin eds., Lecture Notes in Comp. Science, 192, Springer, Berlin 1984.
R. Williams. Classification of shifts of finite type, Annals of Math., 98 (1973), 120–153. Errata, Annals of Math., 99 (1974), 380–381.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Béal, M.P., Mignosi, F., Restivo, A. (1996). Minimal forbidden words and symbolic dynamics. In: Puech, C., Reischuk, R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_45
Download citation
DOI: https://doi.org/10.1007/3-540-60922-9_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60922-3
Online ISBN: 978-3-540-49723-3
eBook Packages: Springer Book Archive