On recognizable subsets of free partially commutative monoids

Y. Metivier
1988 Theoretical Computer Science  
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 word of X is recognizable if X is recognizable and if any iterative factor h has a connected noncommutation graph. 0304-3975/88/$3.50
doi:10.1016/0304-3975(88)90027-8 fatcat:dqhjkpcntvcdbi3hdtqnpvl5zm