Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices

DOI10.1007/978-3-540-78773-0_8zbMath1136.68471OpenAlexW1647154878MaRDI QIDQ5458519

Vladimir Yu. Protasov, Blondel, Vincent D., Raphaël M. Jungers

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_8

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial versus exponential growth in repetition-free binary words
• Overlap-free words and spectra of matrices
• Enumeration of irreducible binary words
• Overlap-free words and finite automata
• On the accuracy of the ellipsoid norm approximation of the joint spectral radius
• Enumeration of factors in the Thue-Morse word
• On the finiteness property for rational matrices
• Growth of repetition-free words -- a review
• A linear-time algorithm to decide whether a binary word contains an overlap
• Asymptotic behaviour of the partition function
• A survey of computational complexity results in systems and control

This page was built for publication: Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices