2017-02-09: Simone Barlocco (MSP)

Sat, 21 Oct 2023 21:24:08 +0100

Simone Barlocco (MSP)

MSP 101: Automata learning

Abstract

Automata learning is a well known technique to infer a finite state machine from a set of observations. One important algorithm for automata learning is the L* algorithm by Dana Angluin. In this 101, I will explain how the L* algorithm works via an example. Afterwards, I will discuss the ingredients of the algorithm both in the standard framework by Angluin and in a recently developed categorical/coalgebraic framework by Jacobs & Silva. Lastly, I plan to outline the proof of the minimality of the automaton that is built by the learning algorithm.

2017-02-09 14:00:00 UTC
LT1310