On Nominal Regular Languages with Binders

Authors

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

Document Type

Conference Proceeding

Publication Date

2012

Abstract

We investigate regular languages on infinite alphabets where words may contain binders on names. To this end, classical regular expressions and automata are extended with binders. We prove the equivalence between finite automata on binders and regular expressions with binders and investigate closure properties and complementation of regular languages with binders.

Comments

This paper was originally presented at International Conference on Foundations of Software Science and Computation Structures (FoSSaCS) in 2012. DOI: 10.1007/978-3-642-28729-9_17

Recommended Citation

Kurz A., Suzuki T., Tuosto E. (2012) On Nominal Regular Languages with Binders. In: Birkedal L. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2012. Lecture Notes in Computer Science, vol 7213. Springer, Berlin, Heidelberg

Copyright

Springer