Nominal Regular Expressions for Languages over Infinite Alphabets. Extended Abstract
Formal Languages and Automata Theory
2013-10-29 v1
Abstract
We propose regular expressions to abstractly model and study properties of resource-aware computations. Inspired by nominal techniques -- as those popular in process calculi -- we extend classical regular expressions with names (to model computational resources) and suitable operators (for allocation, deallocation, scoping of, and freshness conditions on resources). We discuss classes of such nominal regular expressions, show how such expressions have natural interpretations in terms of languages over infinite alphabets, and give Kleene theorems to characterise their formal languages in terms of nominal automata.
Cite
@article{arxiv.1310.7093,
title = {Nominal Regular Expressions for Languages over Infinite Alphabets. Extended Abstract},
author = {Alexander Kurz and Tomoyuki Suzuki and Emilio Tuosto},
journal= {arXiv preprint arXiv:1310.7093},
year = {2013}
}