Polynomial identification of -automata

DOI10.1007/978-3-030-45237-7_20MaRDI QIDQ5164178zbMATH OpenOpenAlexFDO

Authors Dana Angluin, Dana Fisman, Yaara Shoval

Publication date 10 November 2021

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-45237-7_20

zbMATH Keywords

\( \omega \)-regularcharacteristic sampleidentification in the limit

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2080669
• Inference of -languages from prefixes.
• scientific article; zbMATH DE number 996379
• Query learning of derived -tree languages in polynomial time
• Polynomial Distinguishability of Timed Automata

Cites work

• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• An automata-theoretic approach to branching-time model checking
• Characteristic sets for polynomial grammatical inference
• Complexity of automaton identification from given data
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Families of DFAs as Acceptors of omega-Regular Languages
• Finite-state \(\omega\)-languages
• scientific article; zbMATH DE number 3513696 (Why is no real title available?)
• scientific article; zbMATH DE number 1956591 (Why is no real title available?)
• scientific article; zbMATH DE number 1418458 (Why is no real title available?)
• scientific article; zbMATH DE number 7650821 (Why is no real title available?)
• Inferring canonical register automata
• Learning I/O automata
• Learning regular omega languages
• Learning regular omega languages
• Learning regular sets from queries and counterexamples
• Learning symbolic automata
• Learning the Language of Error
• Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
• Mining specifications
• On the learnability of infinitary regular sets
• Regular \(\omega\)-languages with an informative right congruence
• Regular model checking using inference of regular languages
• Teaching a smarter learner.
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(9)

• Inference of -languages from prefixes.
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• Uncountable automatic classes and learning
• Polynomial Distinguishability of Timed Automata
• scientific article; zbMATH DE number 2080669 (Why is no real title available?)
• On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words
• Constructing deterministic parity automata from positive and negative examples
• Constructing concise characteristic samples for acceptors of omega regular languages
• Polynomial inference of universal automata from membership and equivalence queries

This page was built for publication: Polynomial identification of \(\omega \)-automata

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