
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.
FOS: Computer and information sciences, D.1.1; F.4.3; I.3.2, I.3.2, D.1.1, Formal Languages and Automata Theory (cs.FL), F.4.3, Software Science, Computer Science - Formal Languages and Automata Theory
FOS: Computer and information sciences, D.1.1; F.4.3; I.3.2, I.3.2, D.1.1, Formal Languages and Automata Theory (cs.FL), F.4.3, Software Science, Computer Science - Formal Languages and Automata Theory
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 33 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
