Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices
From MaRDI portal
Publication:5458519
Recommendations
Cites work
- scientific article; zbMATH DE number 3912631 (Why is no real title available?)
- scientific article; zbMATH DE number 512830 (Why is no real title available?)
- scientific article; zbMATH DE number 1166285 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 3375319 (Why is no real title available?)
- A linear-time algorithm to decide whether a binary word contains an overlap
- A survey of computational complexity results in systems and control
- Asymptotic behaviour of the partition function
- Enumeration of factors in the Thue-Morse word
- Enumeration of irreducible binary words
- Growth of repetition-free words -- a review
- On the accuracy of the ellipsoid norm approximation of the joint spectral radius
- On the finiteness property for rational matrices
- Overlap-free words and finite automata
- Overlap-free words and spectra of matrices
- Polynomial versus exponential growth in repetition-free binary words
Cited in
(2)
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)