A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions

Authors

Alexander Kurz, Chapman UniversityFollow
Tomoyuki Suzuki, University of Leicester
Emilio Tuosto, University of Leicester

Document Type

Conference Proceeding

Publication Date

2012

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.

Comments

This paper was originally presented at IFIP International Conference on Theoretical Computer Science in 2012. DOI: 10.1007/978-3-642-33475-7_14

Recommended Citation

Kurz A., Suzuki T., Tuosto E. (2012) A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions. In: Baeten J.C.M., Ball T., de Boer F.S. (eds) Theoretical Computer Science. TCS 2012. Lecture Notes in Computer Science, vol 7604. Springer, Berlin, Heidelberg

Copyright

Springer