Sciweavers

Share
FMCO
2006
Springer

Learning Meets Verification

12 years 3 months ago
Learning Meets Verification
In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions catering for specialized or richer classes of automata. Furthermore, we survey their recent application to verification problems.
Martin Leucker
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where FMCO
Authors Martin Leucker
Comments (0)
books