Avoiding or Limiting Regularities in Words
From MaRDI portal
Publication:4613549
DOI10.1007/978-3-319-69152-7_5zbMath1405.05004OpenAlexW2798170172MaRDI QIDQ4613549
Michaël Rao, Pascal Ochem, Matthieu Rosenfeld
Publication date: 24 January 2019
Published in: Trends in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-69152-7_5
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a generalization of abelian equivalence and complexity of infinite words
- Fixed points avoiding abelian \(k\)-powers
- On some generalizations of abelian power avoidability
- Bounds for the generalized repetition threshold
- Last cases of Dejean's conjecture
- The number of binary words avoiding Abelian fourth powers grows exponentially
- Polynomial versus exponential growth in repetition-free binary words
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- Problems in between words and abelian words: \(k\)-abelian avoidability
- Some unsolved problems
- A powerful abelian square-free substitution over 4 letters
- Growth problems for avoidable words
- Growth rates of complexity of power-free languages
- Avoidable patterns in strings of symbols
- Strongly non-repetitive sequences and progression-free sets
- A characterization of the minimum cycle mean in a digraph
- On repetition-free binary words of minimal density
- On uniformly repetitive semigroups
- How many squares must a binary sequence contain?
- On the number of Abelian square-free words on four letters
- On nonrepetitive sequences
- Avoidability of circular formulas
- How many square occurrences must a binary sequence contain?
- Avoiding 2-binomial squares and cubes
- Letter frequency in infinite repetition-free words
- Long binary patterns are abelian 2-avoidable
- Sur un théorème de Thue
- A generalization of repetition threshold
- Doubled patterns are 3-avoidable
- Finite-Repetition threshold for infinite ternary words
- Avoidability of Formulas with Two Variables
- Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words
- Fewest repetitions in infinite binary words
- On Two Stronger Versions of Dejean’s Conjecture
- Finite repetition threshold for large alphabets
- ON ABELIAN POWER-FREE MORPHISMS
- A short proof that shuffle squares are 7-avoidable
- Avoiding Three Consecutive Blocks of the Same Size and Same Sum
- A generator of morphisms for infinite words
- BLOCKING SETS OF TERMS
- Generalized Parikh mappings and homomorphisms
- On the construction of absolutely normal numbers
- Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable
- Preliminaries
- Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$
- The number of binary cube-free words of length up to 47 and their numerical analysis
- On the growth rates of complexity of threshold languages
- Abelian squares are avoidable on 4 letters
- An Experimental Study of Minimum Mean Cycle Algorithms
- THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE
- Avoidability of long 𝑘-abelian repetitions
- Dejean's conjecture and letter frequency
