Fast Computations on Ordered Nominal Sets

David Venhoek; Joshua Moerman; Jurriaan Rot

Fast Computations on Ordered Nominal Sets

David Venhoek
, Joshua Moerman
, Jurriaan Rot

Research output: Working paper / Preprint › Preprint

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.

Original language	English
Publisher	Cornell University - arXiv
Number of pages	38
Publication status	Published - 16 Aug 2022

Publication series

Series	Computing Research Repository
ISSN	2331-8422

Access to Document

http://arxiv.org/abs/1902.08414Licence: Unspecified

1 Conference Article in proceeding
1 Article

Fast computations on ordered nominal sets
Venhoek, D., Moerman, J. & Rot, J., 31 Oct 2022, In: Theor. Comput. Sci.. 935, p. 82-104 23 p.
Research output: Contribution to journal › Article › Academic › peer-review

Open Access
Fast Computations on Ordered Nominal Sets
Venhoek, D., Moerman, J. & Rot, J., 2018, Theoretical Aspects of Computing- ICTAC 2018: 15th International Colloquium. Fischer, B. & Uustalu, T. (eds.). Springer, p. 493-512 20 p. (Lecture Notes in Computer Science, Vol. 11187). (Theoretical Computer Science and General Issues (LNCS subseries), Vol. 11187).
Research output: Chapter in Book/Report/Conference proceeding › Conference Article in proceeding › Academic › peer-review

Cite this

@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",

}

TY - UNPB

T1 - Fast Computations on Ordered Nominal Sets

AU - Venhoek, David

AU - Moerman, Joshua

AU - Rot, Jurriaan

N1 - 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.

PY - 2022/8/16

Y1 - 2022/8/16

N2 - 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.

AB - 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.

M3 - Preprint

T3 - Computing Research Repository

BT - Fast Computations on Ordered Nominal Sets

PB - Cornell University - arXiv

ER -

Fast Computations on Ordered Nominal Sets

Abstract

Publication series

Access to Document

Fingerprint

Research output

Fast computations on ordered nominal sets

Fast Computations on Ordered Nominal Sets

Cite this