Passive learning of deterministic Büchi automata by combinations of DFAs

DOI10.4230/LIPICS.ICALP.2022.114MaRDI QIDQ6560915zbMATH OpenFDO

Authors Christof Löding

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.114

zbMATH Keywords

active learningdeterministic Büchi automatalearning from exampleslearning in the limit

Mathematics Subject Classification ID

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

Recommendations

• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• Learning deterministic automata on infinite words
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• Constructing deterministic parity automata from positive and negative examples
• Constructing deterministic -automata from examples by an extension of the RPNI algorithm

Cited in

(5)

• Constructing deterministic -automata from examples by an extension of the RPNI algorithm
• Constructing deterministic parity automata from positive and negative examples
• Passive learning of regular data languages in polynomial time and data
• Constructing concise characteristic samples for acceptors of omega regular languages
• A robust measure on FDFAs following duo-normalized acceptance

This page was built for publication: Passive learning of deterministic Büchi automata by combinations of DFAs

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