 This is then extended to a symmetric relation by defining if and only if = and = for some strings with .Finally, one takes the reflexive and transitive closure of , which then is a monoid congruence.In the typical situation, the relation is simply given as a set of equations, so that formula_1.