Abstract
In this chapter we present the notion of overlap-free words and show how the number u n of overlap-free words of length n is ruled by joint spectral characteristics. We use these results to provide tight estimates on the asymptotic growth of u n . We provide new algorithms to estimate the joint spectral subradius and the Lyapunov exponent, that appear to be very efficient in practice.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jungers, R. (2009). Overlap-Free Words. In: The Joint Spectral Radius. Lecture Notes in Control and Information Sciences, vol 385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95980-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-95980-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-95979-3
Online ISBN: 978-3-540-95980-9
eBook Packages: EngineeringEngineering (R0)