A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
type: Item
instance of: scholarly article
title: A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
author: Yong Li
author: Yu-Fang Chen
author: Depeng Liu
author: Lijun Zhang
published in: Information and Computation
publication date: 2021-11-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/1610.07380
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7433278
zbMATH Keywords: Büchi automata
zbMATH Keywords: learning algorithm
zbMATH Keywords: automata learning
zbMATH Keywords: observation table
zbMATH Keywords: family of DFAs
zbMATH Keywords: classification tree
zbMATH Keywords: \( L^\ast \)
describes a project that uses: libalf
MaRDI profile type: Publication
OpenAlex ID: W3114699776
cites work: Learning regular omega languages
cites work: Learning regular sets from queries and counterexamples
cites work: Q4417936
cites work: Computer Aided Verification
cites work: Learning Minimal Separating DFA’s for Compositional Verification
cites work: Leveraging weighted automata in compositional reasoning about concurrent probabilistic systems
cites work: Q4807832
cites work: Q4738314
cites work: Synthesis of interface specifications for Java classes
cites work: Learning the Language of Error
cites work: Inferring Canonical Register Automata
cites work: Learning register automata: from languages to program structures
cites work: Learning One-Clock Timed Automata
cites work: Recognizing safety and liveness
cites work: The size-change principle for program termination
cites work: On the learnability of infinitary regular sets
cites work: Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
cites work: Ultimately periodic words of rational ω-languages
cites work: Q4281561
cites work: The complexity of probabilistic verification
cites work: Büchi Store: An Open Repository of Büchi Automata
cites work: A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
cites work: Limit-Deterministic Büchi Automata for Linear Temporal Logic
cites work: Complementing semi-deterministic Büchi automata
cites work: Q5525343
cites work: Q5322945
cites work: Q3384896
cites work: A syntactic congruence for rational \(\omega\)-languages
cites work: Families of DFAs as Acceptors of omega-Regular Languages
cites work: Advanced Ramsey-Based Büchi Automata Inclusion Testing
cites work: Q4385530
cites work: Queries and concept learning
cites work: Q5232903
cites work: Learning nominal automata
cites work: Polynomial Identification of $$\omega $$-Automata
DOI: 10.1016/J.IC.2020.104678
description: scientific article; zbMATH DE number 7433278