Abstract
We show that, in a free partially abelian monoid generated by a finite alphabet A, the subset [ X ∗ ] of A ∗ containing all the words equivalent to a product of words of X is rational if X is a finite set of words, each word containing at least one occurrence of any letter of A. We suppose that the graph the vertices of which are letters of A and the edges of which correspond to noncommuting pairs of letters is connected.
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.
