Abstract
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 .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
