Some decidable congruences of free monoids

Ježek, Jaroslav. "Some decidable congruences of free monoids." Czechoslovak Mathematical Journal 49.3 (1999): 475-480. <http://eudml.org/doc/30499>.

@article{Ježek1999,
abstract = {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.},
author = {Ježek, Jaroslav},
journal = {Czechoslovak Mathematical Journal},
keywords = {free monoids; congruences; decidability},
language = {eng},
number = {3},
pages = {475-480},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Some decidable congruences of free monoids},
url = {http://eudml.org/doc/30499},
volume = {49},
year = {1999},
}

TY - JOUR
AU - Ježek, Jaroslav
TI - Some decidable congruences of free monoids
JO - Czechoslovak Mathematical Journal
PY - 1999
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 49
IS - 3
SP - 475
EP - 480
AB - 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.
LA - eng
KW - free monoids; congruences; decidability
UR - http://eudml.org/doc/30499
ER -