On abelian 2-avoidable binary patterns
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1809720 (Why is no real title available?)
- scientific article; zbMATH DE number 3162927 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3375509 (Why is no real title available?)
- An infinite square-free co-CFL
- Arithmetic progressions in partially ordered sets
- Avoidable patterns in strings of symbols
- Avoiding patterns in the abelian sense
- BLOCKING SETS OF TERMS
- Characterization of the repetitive commutative semigroups
- Every binary pattern of length six is avoidable on the two-letter alphabet
- Intervals in the lattice of varieties
- New problems of pattern avoidance
- On Abelian squares and substitutions
- On uniformly repetitive semigroups
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Strongly non-repetitive sequences and progression-free sets
Cited in
(7)- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
- Everywhere -repetitive sequences and Sturmian words
- Algorithmic combinatorics on partial words
- Fixed points avoiding abelian k-powers
- Long binary patterns are abelian 2-avoidable
- Every binary pattern of length six is avoidable on the two-letter alphabet
- Every binary pattern of length greater than 14 is abelian-2-avoidable
This page was built for publication: On abelian 2-avoidable binary patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877171)
