On Minimal Sturmian Partial Words - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

On Minimal Sturmian Partial Words

Résumé

Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet $A_{\diamond}=A \cup \{\diamond\}$, where ${\diamond}$ stands for a hole and matches (or is {\em compatible} with) every letter in $A$. The \textit{subword complexity} of a partial word $w$, denoted by $p_w(n)$, is the number of distinct full words (those without holes) over the alphabet that are compatible with factors of length $n$ of $w$. A function $f:\N\rightarrow\N$ is $(k,h)$-\textit{feasible} if for each integer $N \geq 1$, there exists a $k$-ary partial word $w$ with $h$ holes such that $p_w(n) = f(n)$ for all $n$, $1\leq n\leq N$. We show that when dealing with feasibility in the context of finite binary partial words, the only linear functions that need investigation are $f(n)=n+1$ and $f(n)=2n$. It turns out that both are $(2,h)$-feasible for all non-negative integers $h$. We classify all minimal partial words with $h$ holes of order $N$ with respect to $f(n)=n+1$, called Sturmian, computing their lengths as well as their numbers, except when $h=0$ in which case we describe an algorithm that generates all minimal Sturmian full words. We show that up to reversal and complement, any minimal Sturmian partial word with one hole is of the form $a^i{\d}a^jba^l$, where $i, j, l$ are integers satisfying some restrictions, that all minimal Sturmian partial words with two holes are one-periodic, and that up to complement, ${\d}(a^{N-1}{\d})^{h-1}$ is the only minimal Sturmian partial word with $h\geq 3$ holes. Finally, we give upper bounds on the lengths of minimal partial words with respect to $f(n)=2n$, which are tight for $h=0, 1$ or $2$.
Fichier principal
Vignette du fichier
23.pdf (274.13 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-00573594 , version 1 (04-03-2011)

Identifiants

  • HAL Id : hal-00573594 , version 1

Citer

F. Blanchet-Sadri, John Lensmire. On Minimal Sturmian Partial Words. Symposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.225-236. ⟨hal-00573594⟩

Collections

STACS2011
28 Consultations
64 Téléchargements

Partager

Gmail Facebook X LinkedIn More