On the Minimal Uncompletable Word Problem

Gabriele Fici, Elena V. Pribavkina, Jacques Sakarovitch

Let S be a finite set of words over an alphabet Sigma. The set S is said to be complete if every word w over the alphabet Sigma is a factor of some element of S*, i.e. w belongs to…