Avoidability Index for Binary Patterns with Reversal

  • James Currie
  • Philip Lafrance
DOI: https://doi.org/10.37236/5483
Keywords: Combinatorics on words, Words avoiding patterns, Reversals

Abstract

For every pattern $p$ over the alphabet $\{x,x^R,y, y^R\}$, we specify the least $k$ such that $p$ is $k$-avoidable.
Published
2016-02-19
How to Cite
Currie, J., & Lafrance, P. (2016). Avoidability Index for Binary Patterns with Reversal. The Electronic Journal of Combinatorics, 23(1), #P1.36. https://doi.org/10.37236/5483
Issue
Volume 23, Issue 1 (2016)
Article Number
P1.36