Abstract
Overlap-free words are words over the alphabet A = {a, b} that do not contain factors of the form xvxvx, where x ∈ A and v ∈ A *. We analyze the asymptotic growth of the number u n of overlap-free words of length n. We obtain explicit formulas for the minimal and maximal rates of growth of u n in terms of spectral characteristics (the lower spectral radius and the joint spectral radius) of one set of matrices of dimension 20. Using these descriptions we provide estimates of the rates of growth that are within 0.4% and 0.03 % of their exact value. The best previously known bounds were within 11% and 3% respectively. We prove that u n actually has the same growth for “almost all” n. This “average” growth is distinct from the maximal and minimal rates and can also be expressed in terms of a spectral quantity (the Lyapunov exponent). We use this expression to estimate it.
This is a shortened version of a journal paper submitted for publication; see [7].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berstel, J.: Growth of repetition-free words–a review. Theoretical Computer Science 340(2), 280–290 (2005)
Blondel, V.D., Nesterov, Y., Theys, J.: On the accuracy of the ellipsoid norm approximation of the joint spectral radius. Linear Algebra and its Applications 394(1), 91–107 (2005)
Blondel, V.D., Tsitsiklis, J.N.: A survey of computational complexity results in systems and control. Automatica 36(9), 1249–1274 (2000)
Brlek, S.: Enumeration of factors in the thue-morse word. Discrete Applied Mathematics 24, 83–96 (1989)
Carpi, A.: Overlap-free words and finite automata. Theoretical Computer Science 115(2), 243–260 (1993)
Cassaigne, J.: Counting overlap-free binary words. In: Enjalbert, P., Wagner, K.W., Finkel, A. (eds.) STACS 1993. LNCS, vol. 665, pp. 216–225. Springer, Heidelberg (1993)
Jungers, R.M., Protasov, V., Blondel, V.D.: Overlap-free words and spectra of matrices (submitted, preprint, 2007), http://arxiv.org/abs/0709.1794
Jungers, R.M., Blondel, V.D.: On the finiteness conjecture for rational matrices. In: Linear Algebra and its Applications (to appear, 2007), doi:10.1016/j.laa.2007.07.007
Karhumäki, J., Shallit, J.: Polynomial versus exponential growth in repetition-free binary words. Journal of Combinatorial Theory Series A 105(2), 335–347 (2004)
Kfoury, A.J.: A linear time algorithm to decide whether a binary word contains an overlap. Theoretical Informatics and Applications 22, 135–145 (1988)
Kobayashi, Y.: Enumeration of irreducible binary words. Discrete Applied Mathematics 20, 221–232 (1988)
Lepistö, A.: A characterization of 2+-free words over a binary alphabet, Master thesis, University of Turku, Finland (1995)
Oseledets, V.I.: A multiplicative ergodic theorem. Lyapunov characteristic numbers for dynamical systems. Transactions of the Moscow Mathematical Society 19, 197–231 (1968)
Protasov, V.Y.: The joint spectral radius and invariant sets of linear operators. Fundamentalnaya i prikladnaya matematika 2(1), 205–231 (1996)
Protasov, V.Y.: On the asymptotics of the partition function. Sbornik Mathematika 191(3-4), 381–414 (2000)
Protasov, V.Y.: On the regularity of de rham curves. Izvestiya Mathematika 68(3), 27–68 (2004)
Restivo, A., Salemi, S.: Overlap-free words on two symbols. In: Perrin, D., Nivat, M. (eds.) Automata on Infinite Words. LNCS, vol. 192, pp. 198–206. Springer, Heidelberg (1985)
Sloane, N.J.A.: On-line encyclopedia of integer sequences, http://www.research.att.com/~njas/sequences
Thue, A.: Uber unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I. Mat. Nat. Kl. 7, 1–22 (1906)
Thue, A.: Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I. Mat. Nat. Kl. 1, 1–67 (1912)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jungers, R.M., Protasov, V.Y., Blondel, V.D. (2008). Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds) LATIN 2008: Theoretical Informatics. LATIN 2008. Lecture Notes in Computer Science, vol 4957. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78773-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-78773-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78772-3
Online ISBN: 978-3-540-78773-0
eBook Packages: Computer ScienceComputer Science (R0)