scientific article; zbMATH DE number 7447748

MaRDI QIDQ3384896zbMATH OpenFDO

Authors Dana Angluin, Dana Fisman

Publication date 17 December 2021

Full work available at URL https://arxiv.org/abs/1809.03108, http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF18.19

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Applications of game theory (91A80)

Recommendations

• Regular \(\omega\)-languages with an informative right congruence
• Characterizations of rational \(\omega\)-languages by means of right congruences
• Inferring regular languages and \(\omega\)-languages
• A classification of \(\omega\)-regular languages
• Fine hierarchy of regular -languages
• Fine hierarchy of regular \(\omega\)-languages
• Beyond \omega-Regular Languages
• Mathematical Foundations of Computer Science 2004
• Extensions of -regular languages
• A syntactic congruence for rational -languages

Cites work

• A generic algorithm for learning symbolic automata from membership queries
• A Proof of Kamp's theorem
• Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
• Characterizations of rational \(\omega\)-languages by means of right congruences
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Families of DFAs as acceptors of -regular languages
• Families of DFAs as Acceptors of omega-Regular Languages
• Finite-state \(\omega\)-languages
• First-order definable languages
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• Inferring regular languages and \(\omega\)-languages
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• Learning I/O automata
• Learning Meets Verification
• Learning regular languages over large ordered alphabets
• Learning regular omega languages
• Learning regular omega languages
• Learning regular sets from queries and counterexamples
• Learning symbolic automata
• Learning weighted automata
• Matrices de Hankel
• On syntactic congruences for \(\omega\)-languages
• On the learnability of infinitary regular sets
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Saturating right congruences
• Sigma*
• Temporal logic can be more expressive
• Transducers with Origin Information
• TYPENESS FOR ω-REGULAR AUTOMATA
• Ultimately periodic words of rational ω-languages

Cited in

(2)

• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• Constructing concise characteristic samples for acceptors of omega regular languages

This page was built for publication:

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