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

Pattern Avoidance and HDOL Words

Pascal Ochem

Abstract

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.
Fichier principal
Vignette du fichier
Pattern_avoidance_and_HDOL_words.pdf (166.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00626116 , version 1 (08-03-2024)

Identifiers

  • HAL Id : lirmm-00626116 , version 1

Cite

Pascal Ochem. Pattern Avoidance and HDOL Words. WORDS 2011 - 8th International Conference on Combinatorics on Words, Sep 2011, Prague, Czech Republic. , 2011. ⟨lirmm-00626116⟩
129 View
3 Download

Share

Gmail Facebook X LinkedIn More