On Non-Complete Sets and Restivo's Conjecture

Vladimir V. Gusev, Elena V. Pribavkina

A finite set S of words over the alphabet A is called non-complete if Fact(S*) is different from A*. A word w in A* - Fact(S*) is said to be uncompletable. We present a series of n…