Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
APA
Leucker, M. (2007). Learning meets verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4709 LNCS, pp. 127–151). Springer Verlag. https://doi.org/10.1007/978-3-540-74792-5_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free