On the structure and extendibility of \(k\)-power free words
From MaRDI portal
Publication:1891362
DOI10.1016/0195-6698(95)90051-9zbMath0824.68094MaRDI QIDQ1891362
Publication date: 30 May 1995
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0195-6698(95)90051-9
68R15: Combinatorics on words
Related Items
Lexicographically least words in the orbit closure of the Rudin-Shapiro word, Periodicity and the golden ratio, The set of \(k\)-power free words over \(\Sigma\) is empty or perfect, Codes and Automata in Minimal Sets, On the Tree of Ternary Square-Free Words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Growth problems for avoidable words
- Avoidable patterns in strings of symbols
- Strongly non-repetitive sequences and progression-free sets
- On nonrepetitive sequences
- Infinite words with linear subword complexity
- On cube-free \(\omega\)-words generated by binary morphisms
- Non-repetitive words: Ages and essences
- Embedding the dual of \(\Pi^\infty\) in the lattice of equational classes of semigroups.
- Sur un théorème de Thue
- Characterization of the repetitive commutative semigroups
- Which graphs allow infinite nonrepetitive walks?
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- BLOCKING SETS OF TERMS
- Binary Sequences which Contain no BBb
- A Transformation with Simple Spectrum which is not Rank One
- Open Problems in Pattern Avoidance
- Abelian squares are avoidable on 4 letters
- Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
