BLOCKING SETS OF TERMS
From MaRDI portal
Publication:3734729
DOI10.1070/SM1984V047N02ABEH002647zbMATH Open0599.20106OpenAlexW2017131087MaRDI QIDQ3734729FDOQ3734729
Authors: A. I. Zimin 
Publication date: 1984
Published in: Mathematics of the USSR-Sbornik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/sm1984v047n02abeh002647
Recommendations
Free semigroups, generators and relations, word problems (20M05) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)
Cited In (51)
- The lexicographically least binary rich word achieving the repetition threshold
- Abelian repetitions in partial words
- Avoidability index for binary patterns with reversal
- Computing the partial word avoidability indices of binary patterns
- Computing the partial word avoidability indices of ternary patterns
- Algorithmic combinatorics on partial words
- Long unavoidable patterns
- Avoidable binary patterns in partial words
- Long binary patterns are abelian 2-avoidable
- Application of entropy compression in pattern avoidance
- Pattern avoidance by palindromes
- Computing depths of patterns
- Avoiding or limiting regularities in words
- Avoidability of formulas with two variables
- Formulas with reversal
- Every binary pattern of length six is avoidable on the two-letter alphabet
- Patterns in words and languages
- Unavoidable binary patterns
- Non-repetitive words: Ages and essences
- Binary words avoiding the pattern AABBCABBA
- The complexity of unavoidable word patterns
- Grasshopper avoidance of patterns
- Squarefree extensions of words
- Avoidance bases for formulas with reversal
- On long words avoiding Zimin patterns
- A tight upper bound on the length of maximal bordered box repetition-free words
- Avoidability of circular formulas
- On combinatorial properties of the Arshon sequence
- On abelian 2-avoidable binary patterns
- Crucial words and the complexity of some extremal problems for sets of prohibited words
- On the aperiodic avoidability of binary patterns with variables and reversals
- Avoidable patterns on two letters
- The origins of combinatorics on words
- From Bi-ideals to Periodicity
- Words strongly avoiding fractional powers
- Avoidability of formulas with two variables
- Growth problems for avoidable words
- Searching for Zimin patterns
- Maximal abelian square-free words of short length.
- A generator of morphisms for infinite words
- Avoiding conjugacy classes on the 5-letter alphabet
- Avoiding Abelian squares in partial words
- On repetition-free binary words of minimal density
- Estimates in Shirshov height theorem
- Pattern avoidance: themes and variations
- A cyclic binary morphism avoiding abelian fourth powers
- Doubled patterns are 3-avoidable
- On the structure and extendibility of \(k\)-power free words
- Highly nonrepetitive sequences: winning strategies from the local Lemma
- On avoidability of formulas with reversal
- Abelian combinatorics on words: a survey
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)
