Constructing finitely presented monoids which have no finite complete presentation.
Semigroup forum, Tome 54 (1997) no. 2, pp. 292-302
Cet article a éte moissonné depuis la source European Digital Mathematics Library
Mots-clés :
complete rewriting systems, word problem, presentations of monoids, irreducible elements, finitely presented monoids
@article{SF_1997__54_2_135529,
author = {Y. Kobayashi and M. Katsura},
title = {Constructing finitely presented monoids which have no finite complete presentation.},
journal = {Semigroup forum},
pages = {292--302},
year = {1997},
volume = {54},
number = {2},
zbl = {0876.20035},
url = {http://geodesic.mathdoc.fr/item/SF_1997__54_2_135529/}
}
Y. Kobayashi; M. Katsura. Constructing finitely presented monoids which have no finite complete presentation.. Semigroup forum, Tome 54 (1997) no. 2, pp. 292-302. http://geodesic.mathdoc.fr/item/SF_1997__54_2_135529/