Go to the corresponding LIPIcs Volume Portal |
Brunet, Paul ;
Silva, Alexandra
A Kleene Theorem for Nominal Automata
pdf-format:
LIPIcs-ICALP-2019-107.pdf (0.6 MB)
Abstract
Nominal automata are a widely studied class of automata designed to recognise languages over infinite alphabets. In this paper, we present a Kleene theorem for nominal automata by providing a syntax to denote regular nominal languages. We use regular expressions with explicit binders for creation and destruction of names and pinpoint an exact property of these expressions - namely memory-finiteness - identifying a subclass of expressions denoting exactly regular nominal languages.BibTeX - Entry
@InProceedings{brunet_et_al:LIPIcs:2019:10683,
author = {Paul Brunet and Alexandra Silva},
title = {{A Kleene Theorem for Nominal Automata}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {107:1--107:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10683},
URN = {urn:nbn:de:0030-drops-106834},
doi = {10.4230/LIPIcs.ICALP.2019.107},
annote = {Keywords: Kleene Theorem, Nominal automata, Bracket Algebra}
}
Keywords:
Kleene Theorem, Nominal automata, Bracket Algebra
Collection:
46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Issue Date:
2019
Date of publication:
04.07.2019
Supplementary Material:
A Coq library is available on https://github.com/monstrencage/BracketAlgebra.