Top-down tree transducers with regular look-ahead
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.
1995 ◽
Vol 143
(2)
◽
pp. 285-308
◽
2016 ◽
Vol 616
◽
pp. 18-58
◽
2004 ◽
Vol 91
(2)
◽
pp. 57-67
◽
1992 ◽
Vol 93
(1)
◽
pp. 43-74
◽
1989 ◽
Vol 33
(1)
◽
pp. 3-5
◽