A regular language is almost fully characterized by its right congruence relation. The same does not hold for regular ω-languages. The right congruence of a regular ω-language may not be informative enough; many regular ω-languages have a trivial right congruence, and in general it is not always possible to define an ω-automaton recognizing a given language that is isomorphic to its right congruence.

The weak regular ω-languages do have fully informative right congruences. That is, any weak regular ω-language can always be recognized by a deterministic B$\ddot{\mathrm{\text{u}}}$chi automaton that is isomorphic to its right congruence. Weak regular ω-languages reside in the lower levels of the expressiveness hierarchy of regular ω-languages. Are there more expressive sub-classes of regular ω-languages that have fully informative right congruences? Can we characterize the class of languages that have trivial right congruences? In this paper we try to place some additional pieces of this big puzzle.

普通语言几乎完全以其正确的全等关系为特征。对于常规的ω语言而言，情况并不相同。常规ω语言的正确同余可能不足以提供足够的信息。许多常规的ω语言具有微不足道的右全等，并且通常并不总是可能定义一个ω-自动机来识别与它的右全等同构的给定语言。

该弱定期ω-语言确实有充分翔实的权利余。也就是说，任何弱的常规ω语言都可以始终由确定性B识别。$\ddot{\mathrm{\text{ü}}}$它的同构同构的chi自动机。弱正规ω -languages驻留在较低水平常规的表现层次的ω -languages。是否有更具表达力的全等正则ω语言的更具表现力的子类？我们可以描述具有微不足道的全等意义的语言类别吗？在本文中，我们尝试放置这个难题的其他部分。