Name
Abstract | ||
|---|---|---|
In this paper, we introduce a new normal form for DPDA's, the ‘Atomic Normal Form’. As an application, using also the concept of ‘address language’ due to Gorn [19, 20], we give alternate and more direct proofs of results of Courcelle [3, 4] relating recursion schemes and DPDA's. Address languages enable us to encode trees even when they are not locally finite. As a consequence, the decidability of a new class of schemes corresponding to the ‘stateless DPDA's’ of [26] is obtained. |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1016/0304-3975(81)90055-4 | THEORETICAL COMPUTER SCIENCE |
DocType | Volume | Issue |
Journal | 14 | 2 |
ISSN | Citations | PageRank |
0304-3975 | 14 | 1.35 |
References | Authors | |
14 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean H. Gallier | 1 | 749 | 111.86 |