A generator of morphisms for infinite words
From MaRDI portal
Publication:3421905
DOI10.1051/ita:2006020zbMath1110.68122OpenAlexW2147340135MaRDI QIDQ3421905
Publication date: 8 February 2007
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2006__40_3_427_0
Related Items (34)
On the aperiodic avoidability of binary patterns with variables and reversals ⋮ Letter frequency in infinite repetition-free words ⋮ Doubled patterns with reversal are 3-avoidable ⋮ Doubled patterns are 3-avoidable ⋮ Repetition thresholds for subdivided graphs and trees ⋮ A family of formulas with reversal of arbitrarily high avoidability index ⋮ Avoidability of formulas with two variables ⋮ Avoiding square-free words on free groups ⋮ Strict bounds for pattern avoidance ⋮ Infinite words containing the minimal number of repetitions ⋮ Computing the partial word avoidability indices of ternary patterns ⋮ Computing Depths of Patterns ⋮ Application of entropy compression in pattern avoidance ⋮ Doubled patterns with reversal and square-free doubled patterns ⋮ Avoiding or Limiting Regularities in Words ⋮ Extremal overlap-free and extremal \(\beta\)-free binary words ⋮ Fewest repetitions versus maximal-exponent powers in infinite binary words ⋮ Growth properties of power-free languages ⋮ Avoidability of palindrome patterns ⋮ Avoiding conjugacy classes on the 5-letter alphabet ⋮ On some interesting ternary formulas ⋮ Avoidability of circular formulas ⋮ Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols ⋮ Avoiding large squares in partial words ⋮ The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ ⋮ Repetition avoidance in products of factors ⋮ Binary words avoiding the pattern AABBCABBA ⋮ Grasshopper avoidance of patterns ⋮ Transition property for cube-free words ⋮ Avoidability of Formulas with Two Variables ⋮ Subword complexity and power avoidance ⋮ Infinite binary words containing repetitions of odd period ⋮ Characterization of some binary words with few squares ⋮ The simplest binary word with only three squares
Cites Work
- Unnamed Item
- Avoiding large squares in infinite binary words
- Polynomial versus exponential growth in repetition-free binary words
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Growth problems for avoidable words
- Avoidable patterns in strings of symbols
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- How many squares must a binary sequence contain?
- Sur un théorème de Thue
- A generalization of repetition threshold
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
- BLOCKING SETS OF TERMS
- Open Problems in Pattern Avoidance
This page was built for publication: A generator of morphisms for infinite words
