Learning automata teams

DOI10.1007/978-3-642-15488-1_6MaRDI QIDQ3588364zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

Publication date 10 September 2010

Published in Grammatical Inference: Theoretical Results and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15488-1_6

zbMATH Keywords

automata teamsDFA learning

Mathematics Subject Classification ID

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

Recommendations

• Universal automata and NFA learning
• Grammatical Inference: Algorithms and Applications
• Learning deterministic finite automata from smallest counterexamples
• scientific article; zbMATH DE number 2089448
• scientific article; zbMATH DE number 1008506

Cited in

(6)

• A sufficient condition to polynomially compute a minimum separating DFA
• State-Merging DFA Induction Algorithms with Mandatory Merge Constraints
• Polynomial characteristic sets for \(DFA\) identification
• scientific article; zbMATH DE number 2019593 (Why is no real title available?)
• Regular inference as vertex coloring
• Grammatical Inference: Algorithms and Applications

This page was built for publication: Learning automata teams

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