A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Families of DFAs as Acceptors of omega-Regular Languages
2016
International Symposium on Mathematical Foundations of Computer Science
Families of dfas (fdfas) provide an alternative formalism for recognizing ω-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. This correlation is beneficial for learning algorithms, and indeed it was recently shown that ω-regular languages can be learned from membership and equivalence queries, using fdfas as the acceptors. In this
doi:10.4230/lipics.mfcs.2016.11
dblp:conf/mfcs/AngluinBF16
fatcat:ybg5qxphqvci3kpxaip3rfign4