Families of DFAs as Acceptors of omega-Regular Languages

DOI10.4230/LIPICS.MFCS.2016.11zbMATH Open1398.68292OpenAlexW2788585152MaRDI QIDQ4608569FDOQ4608569

Authors: 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/

Recommendations

• Families of DFAs as acceptors of \(\omega\)-regular languages
• A classification of \(\omega\)-regular languages
• Accepting conditions for automata on \(\omega\)-languages
• Extensions of \(\omega \)-regular languages
• \(\omega\)-languages accepted by finite automata whose structures are cascade products o resets
• Mathematical Foundations of Computer Science 2004
• scientific article; zbMATH DE number 6764298
• Beyond $\omega$-Regular Languages
• Fine hierarchy of regular \(\omega\)-languages
• Fine hierarchy of regular \(\omega\)-languages

zbMATH Keywords

finite automataomega-regular languages

Mathematics Subject Classification ID

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

Cited In (9)

• Title not available (Why is that?)
• Families of DFAs as acceptors of \(\omega\)-regular languages
• Regular \(\omega\)-languages with an informative right congruence
• Concurrent Kleene algebra with observations: from hypotheses to completeness
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• Kleene theorems for lasso languages and \(\omega \)-languages
• Polynomial identification of \(\omega \)-automata
• Inferring regular languages and \(\omega\)-languages

This page was built for publication: Families of DFAs as Acceptors of omega-Regular Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608569)