Abstract
Given a presentation of a finitely generated commutative monoid M, suitable algorithms compute an explicit completion, the corresponding congruence $$\mathcal{K}$$ , and a subdirect decomposition of M.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have