2 citations · 3 across the 2 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2013★ 1 cited
Nominal Regular Expressions for Languages over Infinite Alphabets. Extended Abstract
Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto
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…
cs.FL2011★ 2 cited
Towards Nominal Formal Languages
Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto
We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions. M…