@inbook {IOPORT.06085041,
    author       = {Kurz, Alexander and Suzuki, Tomoyuki and Tuosto, Emilio},
    title        = {A characterisation of languages on infinite alphabets with nominal regular expressions.},
    year         = {2012},
    booktitle    = {Theoretical computer science. 7th IFIP TC 1/WG 2.2 international conference, TCS 2012, Amsterdam, The Netherlands, September 26--28, 2012. Proceedings},
    isbn         = {978-3-642-33474-0},
    pages        = {193-208},
    publisher    = {Berlin: Springer},
    doi          = {10.1007/978-3-642-33475-7_14},
    abstract     = {Summary: 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.},
    identifier   = {06085041},
}