Constructing finitely presented monoids which have no finite complete presentation.
Semigroup forum, Tome 54 (1997) no. 2, pp. 292-302.

Voir la notice de l'article provenant de 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},
     publisher = {mathdoc},
     volume = {54},
     number = {2},
     year = {1997},
     zbl = {0876.20035},
     url = {http://geodesic.mathdoc.fr/item/SF_1997__54_2_135529/}
}
TY  - JOUR
AU  - Y. Kobayashi
AU  - M. Katsura
TI  - Constructing finitely presented monoids which have no finite complete presentation.
JO  - Semigroup forum
PY  - 1997
SP  - 292
EP  - 302
VL  - 54
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SF_1997__54_2_135529/
ID  - SF_1997__54_2_135529
ER  - 
%0 Journal Article
%A Y. Kobayashi
%A M. Katsura
%T Constructing finitely presented monoids which have no finite complete presentation.
%J Semigroup forum
%D 1997
%P 292-302
%V 54
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SF_1997__54_2_135529/
%F 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/