Search

• < Previous
• 1
• Next >

Families of DFAs as Acceptors of $\omega$-Regular Languages

Families of DFAs (FDFAs) provide an alternative formalism for recognizing $\omega$-regular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to the Myhill-Nerode theorem for regular languages.&nbsp;[&hellip;]