A Kleene theorem for nominal automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2019

A Kleene theorem for nominal automata

Paul Brunet
Alexandra Silva
  • Function : Author
  • PersonId : 895513


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.
Fichier principal
Vignette du fichier
main.pdf (645.11 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02112892 , version 1 (27-04-2019)


  • HAL Id : hal-02112892 , version 1


Paul Brunet, Alexandra Silva. A Kleene theorem for nominal automata. 2019. ⟨hal-02112892⟩
147 View
151 Download


Gmail Mastodon Facebook X LinkedIn More