有序名义集的快速计算
Fast Computations on Ordered Nominal Sets
摘要：
我们展示了如何有效地计算与名义集的全阶对称，通过开发一个直接表示这样的名义集和基本建设。与以前的方法相比，我们直接在轨道水平上工作，这允许精确的复杂性分析。该方法被实现为库ONS（有序名义集）。我们的主要动机是名义自动机，这是识别语言的无限字母表的模型。我们评估ONS在两个应用程序：最小化的自动机和主动自动机学习。在这两种情况下，ONS与现有实现相比具有竞争力，并且在某些输入类别上优于它们。
英文摘要：
We show how to compute efficiently with nominal sets over the total order symmetry, by developing a direct representation of such nominal sets and basic constructions thereon. In contrast to previous approaches, we work directly at the level of orbits, which allows for an accurate complexity analysis. The approach is implemented as the library ONS (Ordered Nominal Sets). Our main motivation is nominal automata, which are models for recognising languages over infinite alphabets. We evaluate ONS in two applications: minimisation of automata and active automata learning. In both cases, ONS is competitive compared to existing implementations and outperforms them for certain classes of inputs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
