1. Some decidable congruences of free monoids Creator: Ježek, Jaroslav Format: bez média and svazek Type: model:article and TEXT Subject: free monoids and congruence of $W$ Language: English Description: 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. Rights: http://creativecommons.org/publicdomain/mark/1.0/ and policy:public