Overlap-free words and spectra of matrices

Theoretical Computer Science

Volumn 410, Issue 38-40, 2009, Pages 3670-3684

  Jungers, Raphaël M ^a   Protasov, Vladimir Y ^b   Blondel, Vincent D ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

Combinatorics on words; Joint spectral radius; Joint spectral subradius; Lyapunov exponent; Overlap free words

Indexed keywords

COMBINATORICS ON WORDS; JOINT SPECTRAL RADIUS; JOINT SPECTRAL SUBRADIUS; LYAPUNOV EXPONENT; OVERLAP-FREE WORDS;

DIFFERENTIAL EQUATIONS; LYAPUNOV METHODS;

MATRIX ALGEBRA;

EID: 68349100152     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.04.022     Document Type: Article

References (28)

1. Berger M.A., and Wang Y. Bounded semigroups of matrices. Linear Algebra and its Applications 166 (1992) 21-27
2. Berstel J. Growth of repetition-free words-a review. Theoretical Computer Science 340 2 (2005) 280-290
3. Blondel V.D., Jungers R., and Protasov V. On the complexity of computing the capacity of codes that avoid forbidden difference patterns. IEEE Transactions on Information Theory 52 11 (2006) 5122-5127
4. Blondel V.D., and Nesterov Y. Computationally efficient approximations of the joint spectral radius. SIAM Journal of Matrix Analysis 27 1 (2005) 256-272
5. Blondel V.D., Nesterov Y., and Theys J. On the accuracy of the ellipsoid norm approximation of the joint spectral radius. Linear Algebra and its Applications 394 1 (2005) 91-107
6. Blondel V.D., and Tsitsiklis J.N. The Lyapunov exponent and joint spectral radius of pairs of matrices are hard-when not impossible-to compute and to approximate. Mathematics of Control, Signals, and Systems 10 (1997) 31-40
7. Blondel V.D., and Tsitsiklis J.N. A survey of computational complexity results in systems and control. Automatica 36 9 (2000) 1249-1274
8. Brlek S. Enumeration of factors in the Thue-Morse word. Discrete Applied Mathematics 24 (1989) 83-96
9. Carpi A. Overlap-free words and finite automata. Theoretical Computer Science 115 2 (1993) 243-260
10. Cassaigne J. Counting overlap-free binary words. STACS 93, Lecture Notes in Computer Science 665 (1993) 216-225
11. Gharavi R., and Anantharam V. An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices. Theoretical Computer Science 332 (2005) 543-557
12. R.M. Jungers, The joint spectral radius, theory and applications, in: Springer-Verlag (Ed.), Lecture Notes in Information and Computer Sciences, vol. 385, Berlin, 2009 (in press)
13. Jungers R.M., and Blondel V.D. On the finiteness property for rational matrices. Linear Algebra and its Applications 428 10 (2008) 2283-2295
14. Jungers R.M., Protasov V., and Blondel V.D. Efficient algorithms for deciding the type of growth of products of integer matrices. Linear Algebra and its Applications 428 10 (2008) 2296-2311
15. Karhumäki J., and Shallit J. Polynomial versus exponential growth in repetition-free binary words. Journal of Combinatorial Theory Series A 105 2 (2004) 335-347
16. Kfoury A.J. A linear time algorithm to decide whether a binary word contains an overlap. Theoretical Informatics and Applications 22 (1988) 135-145
17. Kobayashi Y. Enumeration of irreducible binary words. Discrete Applied Mathematics 20 (1988) 221-232
18. A. Lepistö, A characterization of 2+-free words over a binary alphabet, Master's Thesis, University of Turku, Finland, 1995
19. Oseledets V.I. A multiplicative ergodic theorem. Lyapunov characteristic numbers for dynamical systems. Transactions of the Moscow Mathematical Society 19 (1968) 197-231
20. Parrilo P., and Jadbabaie A. Approximation of the joint spectral radius using sum of squares. Linear Algebra and its Applications 428 10 (2008) 2385-2402
21. Protasov V.Y. The joint spectral radius and invariant sets of linear operators. Fundamentalnaya i prikladnaya matematika 2 1 (1996) 205-231
22. Protasov V.Y. The generalized spectral radius. A geometric approach. Izvestiya Mathematics 61 5 (1997) 995-1030
23. Protasov V.Y. On the asymptotics of the partition function. Sbornik Mathematics 191 3-4 (2000) 381-414
24. Protasov V.Y. On the regularity of de Rham curves. Izvestiya Mathematics 68 3 (2004) 567-606
25. Restivo A., and Salemi S. Overlap-free words on two symbols. Lecture Notes in Computer Science, Automata on Infinite Words vol. 192 (1985) 198-206
26. N.J.A. Sloane, On-line encyclopedia of integer sequences. Url: http://www.research.att.com/~njas/sequences
27. Thue A. Uber unendliche zeichenreihen. Norske Videnskabers Selskabs Skrifter, I Mathematisch-Naturwissenschaftliche Klasse 7 (1906) 1-22
28. Thue A. Uber die gegenseitige lage gleicher teile gewisser zeichenreihen. Norske Videnskabers Selskabs Skrifter, I Mathematisch-Naturwissenschaftliche Klasse 1 (1912) 1-67