A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
From MaRDI portal
Publication:2051763
DOI10.1016/J.IC.2020.104678OpenAlexW3114699776MaRDI QIDQ2051763FDOQ2051763
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
Recommendations
classification treelearning algorithmautomata learning\( L^\ast \)family of DFAsobservation tableBüchi automata
Cites Work
- The complexity of probabilistic verification
- Learning regular sets from queries and counterexamples
- Queries and concept learning
- Learning Minimal Separating DFA’s for Compositional Verification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Title not available (Why is that?)
- Computer Aided Verification
- The size-change principle for program termination
- Synthesis of interface specifications for Java classes
- A syntactic congruence for rational \(\omega\)-languages
- On the learnability of infinitary regular sets
- Learning regular omega languages
- Title not available (Why is that?)
- Recognizing safety and liveness
- Inferring canonical register automata
- Title not available (Why is that?)
- Learning register automata: from languages to program structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Aided Verification
- Query learning of derived \(\omega\)-tree languages in polynomial time
- Ultimately periodic words of rational ω-languages
- Polynomial identification of \(\omega \)-automata
- Limit-deterministic Büchi automata for linear temporal logic
- Advanced Ramsey-based Büchi automata inclusion testing
- Learning the Language of Error
- Families of DFAs as Acceptors of omega-Regular Languages
- Leveraging weighted automata in compositional reasoning about concurrent probabilistic systems
- Learning one-clock timed automata
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Complementing semi-deterministic Büchi automata
- Büchi Store: an open repository of Büchi automata
- Title not available (Why is that?)
- Learning nominal automata
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
Uses Software
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)
