Families of DFAs as Acceptors of omega-Regular Languages

  title={Families of DFAs as Acceptors of omega-Regular Languages},
  author={Dana Angluin and Udi Boker and 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. This correlation is beneficial for learning algorithms, and indeed it was recently shown that omega-regular languages can be learned from membership and equivalence queries, using FDFAs as the acceptors… 
Inferring regular languages and ω-languages
  • D. Fisman
  • Computer Science
    J. Log. Algebraic Methods Program.
  • 2018
Learning to Complement Büchi Automata
A recent learning approach for FDFAs, families of DFAs, that can be used to represent \(\omega \)-regular languages, is used as a basis for a complementation technique and it has proven beneficial not to learn an FDFA that represents the complement language of a Buchi automaton, but to use it as an intermediate construction in the learning cycle.
Passive Learning of Deterministic Büchi Automata by Combinations of DFAs
An algorithm that constructs a deterministic Büchi automaton in polynomial time from given sets of positive and negative example words is presented and it is proved that the resulting algorithm can learn a DBA for each DBA-recognizable language in the limit by providing a characteristic sample for eachDBA- Recognizable language.
Polynomial Identification of ω -Automata (cid:3)
It is shown that the ω -language classes IB, IC, IP, and IM that are isomorphic to their right-congruence automata are identifiable in the limit using polynomial time and data.
Regular omega-Languages with an Informative Right Congruence
This paper tries to place some additional pieces of the big puzzle of the class of languages with a trivial right congruence, which is, any weak regular omega-language can always be recognized by a deterministic Buchi automaton that is isomorphic to the rightcon automaton.
Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries
This work shows that SUBAs can be learned in polynomial time using membership and certain non-proper equivalence queries, which implies that they are polynomially predictable with membership queries.
On the (In)Succinctness of Muller Automata
There is inconsistency and incompleteness in the literature results regarding the translations to and from Muller automata, and the Muller type can be considered less succinct than parity, Rabin, and Streett automata.
Polynomial Identification of ømega-Automata
Identification in the limit using polynomial time and data for models of \(\omega \)-automata shows that the right congruences of languages in these classes are fully informative.
Learning Büchi Automata and Its Applications
An algorithm that learns a Buchi automaton from a teacher who knows an \(\omega \)-regular language based on learning a formalism named family of DFAs (FDFAs) recently proposed by Angluin and Fisman is reviewed.
A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
A novel algorithm to learn a Buchi automaton from a teacher who knows an \(\omega \)-regular language from a formalism named family of DFAs recently proposed by Angluin and Fisman is proposed.