Learning Nominal Automata
Formal Languages and Automata Theory
2018-12-18 v3
Abstract
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 new setting. In particular we can learn a subclass of nominal non-deterministic automata. An implementation using a recently developed Haskell library for nominal computation is provided for preliminary experiments.
Keywords
Cite
@article{arxiv.1607.06268,
title = {Learning Nominal Automata},
author = {Joshua Moerman and Matteo Sammartino and Alexandra Silva and Bartek Klin and Michał Szynwelski},
journal= {arXiv preprint arXiv:1607.06268},
year = {2018}
}