Growth of repetition-free words -- a review
From MaRDI portal
Publication:2484440
Cites work
- scientific article; zbMATH DE number 2186883 (Why is no real title available?)
- scientific article; zbMATH DE number 3912631 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 1264511 (Why is no real title available?)
- scientific article; zbMATH DE number 512830 (Why is no real title available?)
- scientific article; zbMATH DE number 1948509 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 2000848 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- scientific article; zbMATH DE number 3798046 (Why is no real title available?)
- scientific article; zbMATH DE number 3223982 (Why is no real title available?)
- A linear-time algorithm to decide whether a binary word contains an overlap
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- A unified approach to word occurrence probabilities
- Abelian squares are avoidable on 4 letters
- Automatic Sequences
- CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
- Developments in Language Theory
- Enumeration of irreducible binary words
- Improved bounds on the number of ternary square-free words
- Motif statistics.
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- ON ABELIAN POWER-FREE MORPHISMS
- On the entropy and letter frequencies of ternary square-free words
- On the number of Abelian square-free words on four letters
- On the synchronizing properties of certain prefix codes
- Overlap-free words and finite automata
- Partially abelian squarefree words
- Polynomial versus exponential growth in repetition-free binary words
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Sequences generated by infinitely iterated morphisms
- Square-free words on partially commutative free monoids
- The Goulden—Jackson cluster method: extensions, applications and implementations
- The On-Line Encyclopedia of Integer Sequences
- The entropy of square-free words
- The number of binary cube-free words of length up to 47 and their numerical analysis
- There exist binary circular 5/2^+ power free words of every length
- Uniformly growing k-th power-free homomorphisms
Cited in
(15)- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- Stability of linear problems: Joint spectral radius of sets of matrices
- Square-free words obtained from prefixes by permutations
- Binary words avoiding the pattern AABBCABBA
- Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices
- Growth of power-free languages: numerical and asymptotic bounds
- On duplication-free codes for disjoint or equal-length errors
- Growth properties of power-free languages
- Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- Growth of power-free languages over large alphabets
- Volume formula and growth rates of the balls of strings under the edit distances
- Exact computation of joint spectral characteristics of linear operators
- On the entropy and letter frequencies of powerfree words
- Overlap-free words and spectra of matrices
This page was built for publication: Growth of repetition-free words -- a review
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484440)