Paper Info
Title
Nominal Regular Expressions for Languages over Infinite Alphabets. Extended Abstract.
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.
Year
Venue
Field
2013
CoRR
Generalized star height problem,Discrete mathematics,Regular expression,Formal language,Expression (mathematics),Work in process,Automaton,Operator (computer programming),Mathematics,Computation
DocType
Volume
Citations 
Journal
abs/1310.7093
0
PageRank 
References 
Authors
0.34
7
3
Name
Order
Citations
PageRank
Alexander Kurz120415.76
Tomoyuki Suzuki2152.64
Emilio Tuosto349942.62