Skip to main content
Conference ProceedingsOPEN ACCESS

A characterisation of languages on infinite alphabets with nominal regular expressions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7604 LNCS 193-208
DOI: 10.1007/978-3-642-33475-7_14
3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2012 IFIP International Federation for Information Processing.

Cite

CITATION STYLE

APA

Kurz, A., Suzuki, T., & Tuosto, E. (2012). A characterisation of languages on infinite alphabets with nominal regular expressions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7604 LNCS, pp. 193–208). https://doi.org/10.1007/978-3-642-33475-7_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free