Bartek Klin

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 …