Families of DFAs as Acceptors of omega-Regular Languages
From MaRDI portal
Publication:4608569
Recommendations
- Families of DFAs as acceptors of \(\omega\)-regular languages
- A classification of \(\omega\)-regular languages
- Accepting conditions for automata on -languages
- Extensions of \(\omega \)-regular languages
- -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
Cited in
(9)- Families of DFAs as acceptors of \(\omega\)-regular languages
- Regular \(\omega\)-languages with an informative right congruence
- Polynomial identification of \(\omega \)-automata
- Inferring regular languages and \(\omega\)-languages
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- Kleene theorems for lasso languages and \(\omega \)-languages
- 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
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)