A Robust Measure on FDFAs Following Duo-Normalized Acceptance

Dana Fisman, Emmanuel Goldberg, Oded Zimerman

Families of DFAs (FDFAs) are a computational model recognizing $\omega$-regular languages. They were introduced in the quest of finding a Myhill-Nerode theorem for $\omega$-regular languages…