1 research outputs found
Learning nominal automata
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