| Article ID: | iaor1992351 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 2 |
| Start Page Number: | 211 |
| End Page Number: | 222 |
| Publication Date: | Jul 1991 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Wrathall C. |
Linear-time algorithms are given for the Word and Conjugacy Problems for trace monoids (or, free partially commutative monoids, commutation monoids) in which, in addition, some specified generators have inverses.