Towards Nominal Formal Languages
Formal Languages and Automata Theory
2011-02-17 v2
Abstract
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. Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.
Cite
@article{arxiv.1102.3174,
title = {Towards Nominal Formal Languages},
author = {Alexander Kurz and Tomoyuki Suzuki and Emilio Tuosto},
journal= {arXiv preprint arXiv:1102.3174},
year = {2011}
}