2 results
Dana Angluin ; Udi Boker ; Dana Fisman.
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. […]
Published on February 14, 2018
Dana Angluin ; Timos Antonopoulos ; Dana Fisman.
We present the first polynomial time algorithm to learn nontrivial classes of languages of infinite trees. Specifically, our algorithm uses membership and equivalence queries to learn classes of $\omega$-tree languages derived from weak regular $\omega$-word languages in polynomial time. The method […]
Published on August 27, 2019