Notes on congruence relations and factor pumping conditions for rational languages (Q1110344): Difference between revisions

If \(\Sigma\) * is the free semigroup over an alphabet \(\Sigma\), \(L\subseteq \Sigma *\), and \(\sim\) is a congruence on \(\Sigma\) *, then L/\(\sim\) is the set of congruence classes of words in L. The author considers conditions for L/\(\sim\) to be finite, a finite semigroup, or a finite group. Pumping conditions which are equivalent to rationality are also considered for these factors.