The Word Problem for Free Partially Commutative, Partially Associative Groupoids

We examine the idea of a free partially commutative, partially associative groupoid, and show that there is a linear-time algorithm for the word problem. Our work is an attempt to see how word problem results by Book, Liu, and Wrathall for monoids and groups might be extended to groupoids