Document Type
Article
Publication Date
2011
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.
Recommended Citation
Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto: Towards Nominal Formal Languages. CoRR abs/1102.3174 (2011)
Copyright
The authors
Included in
Algebra Commons, Logic and Foundations Commons, Other Computer Engineering Commons, Other Computer Sciences Commons, Other Mathematics Commons