Pattern Avoidance and HDOL Words - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2011

Pattern Avoidance and HDOL Words

Pascal Ochem


In this talk, we consider the possibility that for every avoidable pattern P , there exists a finite set S of forbidden patterns and factors, containg P , such that the words over Σ_λ(P ) are essentially the factors of an HDOL word. This is a strong version of Cassaigne's conjecture. I will give many examples of such HDOL words characterized by forbidden patterns and factors, as well as related open problems. We will also discuss the factor complexity of words avoiding patterns.
No file

Dates and versions

lirmm-00626116 , version 1 (23-09-2011)


  • HAL Id : lirmm-00626116 , version 1


Pascal Ochem. Pattern Avoidance and HDOL Words. WORDS'11: 8th International Conference on Combinatorics on Words, Czech Republic. ⟨lirmm-00626116⟩
98 View
0 Download


Gmail Facebook Twitter LinkedIn More