Name
Abstract | ||
|---|---|---|
We investigate regular languages on infinite alphabets where words may contain binders on names. To this end, classical regular expressions and automata are extended with binders. We prove the equivalence between finite automata on binders and regular expressions with binders and investigate closure properties and complementation of regular languages with binders. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-28729-9_17 | FoSSaCS |
Keywords | Field | DocType |
finite automaton,closure property,infinite alphabet,classical regular expression,nominal regular language,regular expression,regular language | Discrete mathematics,Combinatorics,Regular expression,Automaton,Finite-state machine,Equivalence (measure theory),Tree automaton,Regular language,Mathematics | Conference |
Volume | ISSN | Citations |
7213 | 0302-9743 | 13 |
PageRank | References | Authors |
0.65 | 21 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Kurz | 1 | 204 | 15.76 |
| Tomoyuki Suzuki | 2 | 15 | 1.05 |
| Emilio Tuosto | 3 | 499 | 42.62 |