Families of DFAs as Acceptors of omega-Regular Languages

DOI10.4230/LIPIcs.MFCS.2016.11zbMath1398.68292OpenAlexW2788585152MaRDI QIDQ4608569

Dana Angluin, Udi Boker, Dana Fisman

Publication date: 21 March 2018

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6427/pdf/LIPIcs-MFCS-2016-11.pdf/

zbMATH Keywords

finite automataomega-regular languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items

Inferring regular languages and \(\omega\)-languages, Concurrent Kleene algebra with observations: from hypotheses to completeness, Unnamed Item, A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees, Polynomial Identification of $$\omega $$-Automata, Regular \(\omega\)-languages with an informative right congruence, A novel learning algorithm for Büchi automata based on family of DFAs and classification trees