Skip to main content
Conference ProceedingsOPEN ACCESS

On nominal regular languages with binders

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7213 LNCS 255-269
DOI: 10.1007/978-3-642-28729-9_17
23Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kurz, A., Suzuki, T., & Tuosto, E. (2012). On nominal regular languages with binders. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7213 LNCS, pp. 255–269). https://doi.org/10.1007/978-3-642-28729-9_17

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