Abstract. Given a presentation of a finitely generated commutative monoid $M$, suitable algorithms compute an explicit completion, the corresponding congruence ${\cal K}$, and a subdirect decomposition of $M$.
AMS Subject Classification
(1991): 20M14
Keyword(s):
finitely generated commutative monoids,
completion,
subdirect decomposition,
algorithms
Received May 4, 2010, and in revised form November 6, 2010. (Registered under 33/2010.)
|