Nominal automata are models for accepting languages over infinite alphabets. In this paper we refine the hierarchy of nondeterministic nominal automata, by developing the theory of residual nominal automata. In particular, we show that they admit canonical minimal representatives, and that the universality problem becomes decidable. We also study exact learning of these automata, and settle questions that were left open about their learnability via observations.

中文翻译：

---

残差标称自动机

名义自动机是接受无限字母表语言的模型。在本文中，我们通过发展残差名义自动机的理论来改进非确定性名义自动机的层次结构。特别是，我们表明他们承认规范的最小代表，并且普遍性问题变得可判定。我们还研究了这些自动机的精确学习，并通过观察解决了有关其可学习性的问题。