@techreport{1fa9c1157cd84c3a8522069922d9c8f9,
title = "Fast Computations on Ordered Nominal Sets",
abstract = "Nominal automata are models for recognising languages over infinite alphabets, based on the algebraic notion of nominal set. Motivated by their use in automata theory, we show how to compute efficiently with nominal sets over the so-called total order symmetry, a variant which allows to compare alphabet letters for equality as well as their respective order. We develop an explicit finite representation of such nominal sets and basic constructions thereon. The approach is implemented as the library Ons (Ordered Nominal Sets), enabling programming with infinite sets. Returning to our motivation of nominal automata, 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.",
author = "David Venhoek and Joshua Moerman and Jurriaan Rot",
note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",
year = "2022",
month = aug,
day = "16",
language = "English",
series = "Computing Research Repository",
publisher = "Cornell University - arXiv",
address = "United States",
type = "WorkingPaper",
institution = "Cornell University - arXiv",
}