Avoiding or limiting regularities in words
From MaRDI portal
Recommendations
Cites work
- A characterization of the minimum cycle mean in a digraph
- A generator of morphisms for infinite words
- A powerful abelian square-free substitution over 4 letters
- A short proof that shuffle squares are 7-avoidable
- Abelian squares are avoidable on 4 letters
- An experimental study of minimum mean cycle algorithms
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Avoidability of circular formulas
- Avoidability of formulas with two variables
- Avoidability of long k-abelian repetitions
- Avoidable patterns in strings of symbols
- Avoiding 2-binomial squares and cubes
- Avoiding three consecutive blocks of the same size and same sum
- Avoiding two consecutive blocks of same size and same sum over \(\mathbb{Z}^2\)
- BLOCKING SETS OF TERMS
- Bounds for the generalized repetition threshold
- Dejean's conjecture and letter frequency
- Doubled patterns are 3-avoidable
- Efficient lower bounds on the number of repetition-free words
- Every binary pattern of length greater than 14 is abelian-2-avoidable
- Fewest repetitions in infinite binary words
- Finite repetition threshold for large alphabets
- Finite-repetition threshold for infinite ternary words
- Fixed points avoiding abelian k-powers
- Generalized Parikh mappings and homomorphisms
- Growth problems for avoidable words
- Growth rates of complexity of power-free languages
- How many square occurrences must a binary sequence contain?
- How many squares must a binary sequence contain?
- scientific article; zbMATH DE number 3162927 (Why is no real title available?)
- scientific article; zbMATH DE number 5707089 (Why is no real title available?)
- scientific article; zbMATH DE number 2051154 (Why is no real title available?)
- scientific article; zbMATH DE number 1919522 (Why is no real title available?)
- scientific article; zbMATH DE number 3296252 (Why is no real title available?)
- scientific article; zbMATH DE number 3375509 (Why is no real title available?)
- Last cases of Dejean's conjecture
- Letter frequency in infinite repetition-free words
- Long binary patterns are abelian 2-avoidable
- On a generalization of abelian equivalence and complexity of infinite words
- ON ABELIAN POWER-FREE MORPHISMS
- On nonrepetitive sequences
- On repetition-free binary words of minimal density
- On some generalizations of abelian power avoidability
- On the construction of absolutely normal numbers
- On the growth rates of complexity of threshold languages
- On the number of Abelian square-free words on four letters
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
- On two stronger versions of Dejean's conjecture
- On uniformly repetitive semigroups
- Polynomial versus exponential growth in repetition-free binary words
- Preliminaries [to: Combinatorics, words and symbolic dynamics]
- Problems in between words and abelian words: \(k\)-abelian avoidability
- Some unsolved problems
- Strongly non-repetitive sequences and progression-free sets
- Sur un théorème de Thue
- THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE
- The minimal density of a letter in an infinite ternary square-free word is 883/3215
- The number of binary cube-free words of length up to 47 and their numerical analysis
- The number of binary words avoiding Abelian fourth powers grows exponentially
Cited in
(10)- Multidimensional unrepetitive configurations
- Fractional meanings of nonrepetitiveness
- Repetition avoidance in products of factors
- A generator of morphisms for infinite words
- scientific article; zbMATH DE number 1975027 (Why is no real title available?)
- Avoiding squares over words with lists of size three amongst four symbols
- Repetitions in words
- Abelian combinatorics on words: a survey
- The repetition threshold for ternary rich words
- Growth rate of binary words avoiding \(xxx^{R}\)
This page was built for publication: Avoiding or limiting regularities in words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4613549)
