A synergic approach to the minimal uncompletable words problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

A synergic approach to the minimal uncompletable words problem

Résumé

A finite language X over an alphabet Σ is complete if any word in Σ* is a factor of a word in X*. A word which is not a factor of X* is said uncompletable. Among them, some are minimal as all their proper factors belong to Fact(X*). The problem is to find bounds on the length of the shortest minimal uncompletable words depending on k, the maximal length of words in X. Though Restivo’s conjecture stating an upper bound in 2k^2 was already contradicted twice, the problem of the existence of a quadratic upper bound is still open. Our approach is original and synergic. We start by characterizing minimal uncompletable words. An efficient algorithm is given to speed up the search of such words. Finally, a genetic algorithm using a SAT-solver allows us to obtain new results for the first values of k.
Fichier non déposé

Dates et versions

hal-01342479 , version 1 (06-07-2016)

Identifiants

  • HAL Id : hal-01342479 , version 1

Citer

Sandrine Julia, Arnaud Malapert, Julien Provillard. A synergic approach to the minimal uncompletable words problem. 16th Mons Theoretical Computer Science Days , Sep 2016, Liège, Belgium. ⟨hal-01342479⟩
142 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More