Abstract
Top-down tree transducers with regular look-ahead are introduced. It is shown how these can be decomposed and composed, and how this leads to closure properties of surface sets and tree transformation languages. Particular attention is paid to deterministic tree transducers.
| Original language | Undefined |
|---|---|
| Pages (from-to) | 289-303 |
| Journal | Mathematical systems theory |
| Volume | 10 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1977 |
Keywords
- IR-85445