2000 character limit reached
Towards Nominal Formal Languages (1102.3174v2)
Published 15 Feb 2011 in cs.FL
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.