On the Minimal Uncompletable Word Problem

Let S be a finite set of words such that Fact(S ) = . We deal with the problem of finding bounds on the minimal length of words in \ Fact(S ) in terms of the maximal length of words in S.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Gabriele Fici, Elena V. Pribavkina, Jacques Sakarovitch
• Keywords: CORR 2010, Education, Maximal Length