Matteo Sammartino

Learning nominal automata

2017 · ACM SIGPLAN Notices

We present an Angluin-style algorithm to learn nominal automata, which are acceptors of languages over infinite (structured) alphabets. The abstract approach we take allows us to seamlessly extend known variations of the algorithm to this …

Bases for algebras over a monad.

2020 · arXiv (Cornell University)

One of the fundamental notions of linear algebra is the concept of a basis for a vector space. In the category theoretic formulation of universal algebra, vector spaces are the Eilenberg-Moore algebras over the free …

A Categorical Framework for Learning Generalised Tree Automata

2020 · arXiv (Cornell University)

Automata learning is a popular technique used to automatically construct an automaton model from queries. Much research went into devising ad hoc adaptations of algorithms for different types of automata. The CALF project seeks to …