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

DOI10.1007/978-3-540-78773-0_8zbMATH Open1136.68471OpenAlexW1647154878MaRDI QIDQ5458519FDOQ5458519

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

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

Recommendations

• Overlap-free words and spectra of matrices
• scientific article; zbMATH DE number 512830
• Two-Sided Bounds for the Growth Rates of Power-Free Languages
• scientific article; zbMATH DE number 3912631
• Overlap-free words and finite automata

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

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

Cited In (2)

• Processes, Terms and Cycles: Steps on the Road to Infinity
• Overlap-free words and spectra of matrices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458519)