Learning deterministic finite automata from smallest counterexamples

DOI10.1137/S0895480198340943MaRDI QIDQ2706180zbMATH OpenOpenAlexWikidataFDO

Authors Andreas Birkendorf, Andreas Böker, Hans Ulrich Simon

Publication date 19 March 2001

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480198340943

zbMATH Keywords

deterministic finite automatalearning from smallest counterexamplesmultiplicity automataself-directed learning

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 1303603
• Publication:4942035
• Learning unary automata
• The query complexity of learning DFA
• Learning commutative deterministic finite state automata in polynomial time

Cited in

(15)

• Learning fallible deterministic finite automata
• Learning unary automata
• Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings
• Efficient learning of real time two-counter automata
• Learning automata teams
• scientific article; zbMATH DE number 1303603 (Why is no real title available?)
• Automata Learning through Counterexample Guided Abstraction Refinement
• Learning two-tape automata from queries and counterexamples
• scientific article; zbMATH DE number 1418473 (Why is no real title available?)
• Learning DFA from simple examples
• Learning from positive and negative examples: new proof for binary alphabets
• Passive automata learning: DFAs and NFAs
• A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages
• Learning commutative deterministic finite state automata in polynomial time
• Automatic symbolic compositional verification by learning assumptions

This page was built for publication: Learning deterministic finite automata from smallest counterexamples

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