On abelian 2-avoidable binary patterns
From MaRDI portal
Publication:877171
DOI10.1007/S00236-006-0030-ZzbMATH Open1111.68094OpenAlexW1982010621MaRDI QIDQ877171FDOQ877171
Authors: Terry I. Visentin, James D. Currie 
Publication date: 19 April 2007
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-006-0030-z
Recommendations
Cites Work
- Avoidable patterns in strings of symbols
- Every binary pattern of length six is avoidable on the two-letter alphabet
- BLOCKING SETS OF TERMS
- Title not available (Why is that?)
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Title not available (Why is that?)
- Strongly non-repetitive sequences and progression-free sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- On uniformly repetitive semigroups
- On Abelian squares and substitutions
- Intervals in the lattice of varieties
- Arithmetic progressions in partially ordered sets
- Characterization of the repetitive commutative semigroups
- New problems of pattern avoidance
- Avoiding patterns in the abelian sense
- Title not available (Why is that?)
- An infinite square-free co-CFL
Cited In (7)
- Everywhere \(\alpha \)-repetitive sequences and Sturmian words
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
- Algorithmic combinatorics on partial words
- Long binary patterns are abelian 2-avoidable
- Fixed points avoiding abelian \(k\)-powers
- 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)
