Insights to Angluin's learning

MaRDI QIDQ2849548zbMATH OpenFDO

Authors Therese Berg, Martin Leucker, Mayank Saksena, Bengt Jonsson

Publication date 20 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104053216

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Learning regular languages over large ordered alphabets
• A generic algorithm for learning symbolic automata from membership queries
• scientific article; zbMATH DE number 1008506
• Active learning of nondeterministic finite state machines
• Learning Algorithms and Formal Verification (Invited Tutorial)

Cited in

(8)

• Analyzing robustness of Angluin's \(L^*\) algorithm in presence of noise
• Learning Meets Verification
• Active learning of nondeterministic finite state machines
• Benchmarking combinations of learning and testing algorithms for active automata learning
• Compositional CSP traces refinement checking
• AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee
• Analyzing robustness of Angluin's \(\mathrm{L}^\ast\) algorithm in presence of noise
• Angluin learning via logic

This page was built for publication: Insights to Angluin's learning

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