Abstract

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.

Full Text
Published version (Free)

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 call