# Families of DFAs as Acceptors of $ω$-Regular Languages

@article{Angluin2018FamiliesOD,
title={Families of DFAs as Acceptors of \\omega$\$-Regular Languages},
author={Dana Angluin and Udi Boker and Dana Fisman},
journal={Log. Methods Comput. Sci.},
year={2018},
volume={14}
}
• Published 24 December 2016
• Computer Science
• Log. Methods Comput. Sci.
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…

## Figures from this paper

FORQ-based Language Inclusion Formal Testing
• Computer Science
ArXiv
• 2022
A novel algorithm to decide the language inclusion between (nondeterministic) B¨uchi automata, a PSpace -complete problem, is proposed and scales up better than the state-of-the-art on a variety of benchmarks including benchmarks from program verification and theorem proving for word combinatorics.
Ω-Automata: A Coalgebraic Perspective on Regular ω-Languages
• Computer Science
• 2019
This work provides a simple coalgebraic characterisation of regular ω-languages based on languages of lassos, and prove a number of related mathematical results, framed into the theory of a new kind of automata called Ω-automata, which share some attractive properties with deterministic automata operating on finite words.
Ω-Automata: A Coalgebraic Perspective on Regular ω-Languages
• Computer Science
• 2019
This work provides a simple coalgebraic characterisation of regular ω-languages based on languages of lassos, and prove a number of related mathematical results, framed into the theory of a new kind of automata called Ω-automata, which share some attractive properties with deterministic automata operating on finite words.
Why These Automata Types?
This work shows that unifying or intersecting deterministic automata of the classic ω-regularcomplete types, namely parity, Rabin, Streett, and Muller, involves an exponential size blowup, and argues that there are good reasons for the classic types, mainly in the case of nondeterministic and alternating automata.
Regular omega-Languages with an Informative Right Congruence
• Computer Science
GandALF
• 2018
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.
Minimization of Limit-Average Automata
• Computer Science
IJCAI
• 2021
This paper presents a minimization algorithm for LimAvgautomata, and presents an extension of Angluin’s L∗-algorithm with syntactic queries, which learns in polynomial time a LimAvg-automaton equivalent to the target one.
Congruence Relations for B\"uchi Automata
• Computer Science, Mathematics
• 2021
An optimal translation from B¨uchi automata to a family of deterministic ﬁnite automata (FDFW) that accepts the complementary language is obtained.
A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
• Computer Science
TACAS
• 2017
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.
Regular ω-languages with an informative right congruence
• Computer Science, Linguistics
Inf. Comput.
• 2021
Bounds in Query Learning
• Computer Science
COLT
• 2020
This work gives an algorithm which learns a class in polynomially many queries whenever any such algorithm exists, and studies equivalence query learning in a randomized model, producing new bounds on the expected number of queries required to learn an arbitrary concept.

## References

SHOWING 1-10 OF 46 REFERENCES
A B\"uchi complementation algorithm whose complexity meets, modulo a quadratic (O(n2)) factor, the known lower bound for B\", which improves over previous constructions by an exponential factor and concludes the quest for optimal B\"uch complementation algorithms.
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.
On Syntactic Congruences for Omega-Languages
• Linguistics, Mathematics
STACS
• 1993
Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Computer Science
TACAS
• 2008
This work extends the automaton synthesis paradigm for the infinitary languages by presenting an algorithm to learn an arbitrary regular set of infinite sequences (an ω-regular language) over an alphabet Σ.
Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
A new lower bound technique is introduced for the state complexity of transformations of automata and an Ω((0.76n) n ) lower bound for Buchi complementation is proved, which also holds for almost every complementation and determinization transformation of nondeterministicπ-automata.
From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata
• N. Piterman
• Computer Science
Log. Methods Comput. Sci.
• 2007
This paper shows how to construct deterministic automata with fewer states and parity acceptance conditions, and revisits Safra's determinization constructions for automata on infinite words.
Learning Regular Omega Languages
• Computer Science
ALT
• 2014
A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
• Computer Science
TACAS
• 2017
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.
Decidability of second-order theories and automata on infinite trees
Introduction. In this paper we solve the decision problem of a certain secondorder mathematical theory and apply it to obtain a large number of decidability results. The method of solution involves
Using Language Inference to Verify Omega-Regular Properties
• Computer Science
TACAS
• 2005
An algorithm for verification of ω-regular properties of such infinite state systems using Angluin's L* algorithm for learning regular languages, for systems for whom the fixpoint can be represented as a regular set is developed.