The word problem for the braid inverse monoid (Algorithms in Algebraic Systems and Computation Theory)
Isamu Inata, Naoki Kataumi, Takatoshi Tobita · Kyoto University Research Information Repository (Kyoto University) · 2002
1Monoid presentationsLet $A$ be an alphabet and $A^{*}$ the free monoid generated by $A$ .The empty word is denoted by 1If amonoid $M$ has apresentation $(A, R)$ such that both $A$ and $R$ are finite, then we say that $M$