Constructing deterministic parity automata from positive and negative examples

DOI10.46298/THEORETICS.24.17zbMATH Open1547.68283MaRDI QIDQ6586928FDOQ6586928

Authors: Christof Löding 

Publication date: 13 August 2024

Published in: TheoretiCS (Search for Journal in Brave)

Recommendations

• Constructing deterministic \(\omega\)-automata from examples by an extension of the RPNI algorithm
• Passive learning of deterministic Büchi automata by combinations of DFAs
• Learning deterministic automata on infinite words
• Construction of a Deterministicω-Automaton Using Derivatives

zbMATH Keywords

learning in the limitlearning from examplesdeterministic parity automatafamily of right congruences

Mathematics Subject Classification ID

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

Cites Work

• Learning regular sets from queries and counterexamples
• Title not available (Why is that?)
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Language identification in the limit
• Title not available (Why is that?)
• Green's relations and their use in automata theory
• Title not available (Why is that?)
• Complexity of automaton identification from given data
• On syntactic congruences for \(\omega\)-languages
• Inference of \(\omega\)-languages from prefixes.
• On the learnability of infinitary regular sets
• Learning regular omega languages
• State Reduction in Incompletely Specified Finite-State Machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Facets of Synthesis: Revisiting Church’s Problem
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Title not available (Why is that?)
• Ultimately periodic words of rational ω-languages
• Polynomial identification of \(\omega \)-automata
• 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
• Learning infinite-word automata with loop-index queries
• On the Inference of Finite State Automata from Positive and Negative Data
• Title not available (Why is that?)
• Constructing deterministic \(\omega\)-automata from examples by an extension of the RPNI algorithm
• Passive learning of deterministic Büchi automata by combinations of DFAs
• Natural colors of Infinite words

Cited In (2)

• Passive learning of deterministic Büchi automata by combinations of DFAs
• Constructing deterministic \(\omega\)-automata from examples by an extension of the RPNI algorithm

This page was built for publication: Constructing deterministic parity automata from positive and negative examples

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