BLOCKING SETS OF TERMS
From MaRDI portal
Recommendations
Cited in
(51)- A cyclic binary morphism avoiding abelian fourth powers
- Long unavoidable patterns
- Avoidable patterns on two letters
- Every binary pattern of length six is avoidable on the two-letter alphabet
- On repetition-free binary words of minimal density
- Unavoidable binary patterns
- Avoidance bases for formulas with reversal
- Avoidability of formulas with two variables
- Avoidability of circular formulas
- Patterns in words and languages
- Maximal abelian square-free words of short length.
- On the structure and extendibility of \(k\)-power free words
- Non-repetitive words: Ages and essences
- Words strongly avoiding fractional powers
- Formulas with reversal
- The complexity of unavoidable word patterns
- Pattern avoidance by palindromes
- On long words avoiding Zimin patterns
- On the aperiodic avoidability of binary patterns with variables and reversals
- Long binary patterns are abelian 2-avoidable
- Searching for Zimin patterns
- Avoidability index for binary patterns with reversal
- Doubled patterns are 3-avoidable
- Avoidability of formulas with two variables
- Computing depths of patterns
- Highly nonrepetitive sequences: winning strategies from the local Lemma
- Avoiding conjugacy classes on the 5-letter alphabet
- A generator of morphisms for infinite words
- From Bi-ideals to Periodicity
- Computing the partial word avoidability indices of binary patterns
- Computing the partial word avoidability indices of ternary patterns
- Application of entropy compression in pattern avoidance
- Avoiding or limiting regularities in words
- On avoidability of formulas with reversal
- Algorithmic combinatorics on partial words
- Squarefree extensions of words
- Binary words avoiding the pattern AABBCABBA
- Estimates in Shirshov height theorem
- Pattern avoidance: themes and variations
- On combinatorial properties of the Arshon sequence
- Crucial words and the complexity of some extremal problems for sets of prohibited words
- Abelian combinatorics on words: a survey
- A tight upper bound on the length of maximal bordered box repetition-free words
- Avoiding Abelian squares in partial words
- Abelian repetitions in partial words
- The lexicographically least binary rich word achieving the repetition threshold
- Grasshopper avoidance of patterns
- Avoidable binary patterns in partial words
- The origins of combinatorics on words
- On abelian 2-avoidable binary patterns
- Growth problems for avoidable words
This page was built for publication: BLOCKING SETS OF TERMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3734729)
