Geodesic
Some decidable congruences of free monoids
Czechoslovak Mathematical Journal, Tome 49 (1999) no. 3, pp. 475-480

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

Let $W$ be the free monoid over a finite alphabet $A$. We prove that a congruence of $W$ generated by a finite number of pairs $\langle au,u\rangle $, where $a\in A$ and $u\in W$, is always decidable.
Classification : 03B25, 03C05, 08A30, 20M05 
@article{CMJ_1999__49_3_a1,
     author = {Je\v{z}ek, Jaroslav},
     title = {Some decidable congruences of free monoids},
     journal = {Czechoslovak Mathematical Journal},
     pages = {475--480},
     publisher = {mathdoc},
     volume = {49},
     number = {3},
     year = {1999},
     mrnumber = {1707983},
     zbl = {1008.20049},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_1999__49_3_a1/}
}
TY  - JOUR
AU  - Ježek, Jaroslav
TI  - Some decidable congruences of free monoids
JO  - Czechoslovak Mathematical Journal
PY  - 1999
SP  - 475
EP  - 480
VL  - 49
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CMJ_1999__49_3_a1/
LA  - en
ID  - CMJ_1999__49_3_a1
ER  - 
%0 Journal Article
%A Ježek, Jaroslav
%T Some decidable congruences of free monoids
%J Czechoslovak Mathematical Journal
%D 1999
%P 475-480
%V 49
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CMJ_1999__49_3_a1/
%G en
%F CMJ_1999__49_3_a1
Ježek, Jaroslav. Some decidable congruences of free monoids. Czechoslovak Mathematical Journal, Tome 49 (1999) no. 3, pp. 475-480. http://geodesic.mathdoc.fr/item/CMJ_1999__49_3_a1/