Non-primitive words of the formpqm
Othman Echi · RAIRO - Theoretical Informatics and Applications · 2017
Let p,q be two distinct primitive words. According to Lentin−Schutzenberger [], the language p + q + contains at most one non-primitive word and if p q m is not primitive, then . In this paper we give a sharper upper bound, namely, where ⌊ x ⌋ stands for the floor of x .