Brunet, P;
Silva, A;
(2019)
A kleene theorem for nominal automata.
In:
46th International Colloquium on Automata, Languages, and Programming (ICALP 2019).
(pp. 107:1-107:13).
Dagstuhl Publishing: Patras, Greece.
Preview |
Text
Silva VoR CC LIPIcs-ICALP-2019-107.pdf - Published Version Download (603kB) | Preview |
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
| Type: | Proceedings paper |
|---|---|
| Title: | A kleene theorem for nominal automata |
| Event: | 46th International Colloquium on Automata, Languages and Programming |
| Location: | Patras, Greece |
| Dates: | 8-12 July 2019 |
| ISBN-13: | 9783959771092 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.4230/LIPIcs.ICALP.2019.107 |
| Publisher version: | http://dx.doi.org/10.4230/LIPIcs.ICALP.2019.107 |
| Language: | English |
| Additional information: | licensed under Creative Commons License CC-BY https://creativecommons.org/licenses/by/3.0/ |
| Keywords: | Kleene Theorem, Nominal automata, Bracket Algebra |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10079010 |
Archive Staff Only
 |
View Item |
