Learning Nominal Automata
Joshua Moerman, Matteo Sammartino, Alexandra Silva, Bartek, Klin, Micha{\l} Szynwelski
TL;DR
This paper introduces an Angluin-style algorithm for learning nominal automata that operate over infinite structured alphabets, extending existing algorithms to this new setting and demonstrating preliminary implementation results.
Contribution
It develops a novel learning algorithm for nominal automata over infinite alphabets, extending known algorithms to this domain.
Findings
Successfully extended Angluin-style algorithm to nominal automata
Implemented prototype using Haskell library for nominal computation
Preliminary experiments show feasibility of the approach
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.