Constructing deterministic parity automata from positive and negative examples

DOI10.46298/THEORETICS.24.17MaRDI QIDQ6586928zbMATH OpenFDO

Authors Christof Löding

Publication date 13 August 2024

Published in TheoretiCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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)

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

Cites work

• scientific article; zbMATH DE number 5872401 (Why is no real title available?)
• scientific article; zbMATH DE number 6904778 (Why is no real title available?)
• scientific article; zbMATH DE number 3427224 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 2079047 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• Complexity of automaton identification from given data
• Constructing deterministic \(\omega\)-automata from examples by an extension of the RPNI algorithm
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Facets of Synthesis: Revisiting Church’s Problem
• Families of DFAs as acceptors of \(\omega\)-regular languages
• Green's relations and their use in automata theory
• Inference of -languages from prefixes.
• Language identification in the limit
• Learning infinite-word automata with loop-index queries
• Learning regular omega languages
• Learning regular sets from queries and counterexamples
• Natural colors of Infinite words
• On syntactic congruences for \(\omega\)-languages
• On the Inference of Finite State Automata from Positive and Negative Data
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• On the learnability of infinitary regular sets
• Passive learning of deterministic Büchi automata by combinations of DFAs
• Polynomial identification of \(\omega \)-automata
• State Reduction in Incompletely Specified Finite-State Machines
• Ultimately periodic words of rational ω-languages

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)