Name
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. |
Year | Venue | Keywords |
|---|---|---|
2011 | Clinical Orthopaedics and Related Research | regular expression,automata theory,formal language |
Field | DocType | Volume |
Discrete mathematics,Regular expression,Formal language,Abstract family of languages,Monoid,Cone (formal languages),Pumping lemma for regular languages,Regular grammar,Regular language,Mathematics | Journal | abs/1102.3 |
Citations | PageRank | References |
1 | 0.36 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Kurz | 1 | 204 | 15.76 |
| Tomoyuki Suzuki | 2 | 15 | 2.64 |
| Emilio Tuosto | 3 | 499 | 42.62 |