A novel learning algorithm for Büchi automata based on family of DFAs and classification trees

DOI10.1016/J.IC.2020.104678MaRDI QIDQ2051763zbMATH OpenOpenAlexFDO

Authors Yong Li, Yu-Fang Chen, Depeng Liu, Lijun Zhang

Publication date 25 November 2021

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.07380

zbMATH Keywords

classification treelearning algorithmautomata learning\( L^\ast \)family of DFAsobservation tableBüchi automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• Learning of Regular ω-Tree Languages
• Learning deterministic automata on infinite words
• Learning to complement Büchi automata
• Learning regular omega languages

Cites work

• scientific article; zbMATH DE number 7447748 (Why is no real title available?)
• scientific article; zbMATH DE number 512864 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1956591 (Why is no real title available?)
• scientific article; zbMATH DE number 2087513 (Why is no real title available?)
• scientific article; zbMATH DE number 1916673 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• A syntactic congruence for rational \(\omega\)-languages
• Advanced Ramsey-based Büchi automata inclusion testing
• Büchi Store: an open repository of Büchi automata
• Complementing semi-deterministic Büchi automata
• Computer Aided Verification
• Computer Aided Verification
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Families of DFAs as Acceptors of omega-Regular Languages
• Inferring canonical register automata
• Learning Minimal Separating DFA’s for Compositional Verification
• Learning nominal automata
• Learning one-clock timed automata
• Learning register automata: from languages to program structures
• Learning regular omega languages
• Learning regular sets from queries and counterexamples
• Learning the Language of Error
• Leveraging weighted automata in compositional reasoning about concurrent probabilistic systems
• Limit-deterministic Büchi automata for linear temporal logic
• On the learnability of infinitary regular sets
• Polynomial identification of \(\omega \)-automata
• Queries and concept learning
• Query learning of derived \(\omega\)-tree languages in polynomial time
• Recognizing safety and liveness
• Synthesis of interface specifications for Java classes
• The complexity of probabilistic verification
• The size-change principle for program termination
• Ultimately periodic words of rational ω-languages

Cited in

(7)

• Learning deterministic automata on infinite words
• Passive learning of deterministic Büchi automata by combinations of DFAs
• On the power of finite ambiguity in Büchi complementation
• Families of DFAs as acceptors of \(\omega\)-regular languages
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• Learn with SAT to minimize Büchi automata
• FORQ-Based Language Inclusion Formal Testing

Describes a project that uses

Uses Software

• libalf

This page was built for publication: A novel learning algorithm for Büchi automata based on family of DFAs and classification trees

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