Moerman, J;
Sammartino, M;
Silva, A;
Klin, B;
Szynwelski, M;
(2017)
Learning nominal automata.
ACM SIGPLAN Notices - POPL '17
, 52
(1)
pp. 613-625.
10.1145/3093333.3009879.
Preview |
Text
Silva_Learning nominal automata_AAM.pdf - Accepted Version Download (870kB) | Preview |
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.
| Type: | Article |
|---|---|
| Title: | Learning nominal automata |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1145/3093333.3009879 |
| Publisher version: | https://doi.org/10.1145/3093333.3009879 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery-pp.ucl.ac.uk/id/eprint/10085264 |
Archive Staff Only
 |
View Item |
