A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions

Emilio Tuosto

Abstract

We give a characterisation of languages on infinite alphabets in a variant of nominal regular expressions with permutations (p-NREs). We also introduce automata with fresh name generations and permutations (fp-automata), inspired by history-dependent automata (HDAs) and fresh-register automata. Noteworthy, permutations require to deal with dynamic context-dependent expressions. Finally, we give a Kleene theorem for p-NREs and fp-automata to formally characterise languages on infinite alphabets.
Fichier principal
Vignette du fichier
978-3-642-33475-7_14_Chapter.pdf (502.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01556226 , version 1 (04-07-2017)

Licence

Attribution

Identifiers

Cite

Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto. A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.193-208, ⟨10.1007/978-3-642-33475-7_14⟩. ⟨hal-01556226⟩
40 View
91 Download

Altmetric

Share

Gmail Facebook X LinkedIn More