A generator of morphisms for infinite words
From MaRDI portal
Publication:3421905
DOI10.1051/ita:2006020zbMath1110.68122MaRDI 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
68R15: Combinatorics on words
Related Items
Avoiding or Limiting Regularities in Words, The simplest binary word with only three squares, The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$, Binary words avoiding the pattern AABBCABBA, On some interesting ternary formulas, Transition property for cube-free words, Strict bounds for pattern avoidance, Infinite words containing the minimal number of repetitions, Computing the partial word avoidability indices of ternary patterns, Application of entropy compression in pattern avoidance, Growth properties of power-free languages, Avoiding large squares in partial words, Fewest repetitions versus maximal-exponent powers in infinite binary words, Grasshopper avoidance of patterns, Avoidability of formulas with two variables, Avoidability of circular formulas, Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols, Doubled patterns with reversal are 3-avoidable, Extremal overlap-free and extremal \(\beta\)-free binary words, Avoidability of palindrome patterns, Repetition avoidance in products of factors, Subword complexity and power avoidance, Infinite binary words containing repetitions of odd period, Characterization of some binary words with few squares, On the aperiodic avoidability of binary patterns with variables and reversals, Letter frequency in infinite repetition-free words, Doubled patterns are 3-avoidable, A family of formulas with reversal of arbitrarily high avoidability index, Avoiding square-free words on free groups, Doubled patterns with reversal and square-free doubled patterns, Avoidability of Formulas with Two Variables, Repetition thresholds for subdivided graphs and trees, Computing Depths of Patterns, Avoiding conjugacy classes on the 5-letter alphabet
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
