Alphabetic pushdown tree transducers

Authors:
George Rahonis
Affiliations:
Department of Mathematics, Aristotle University of Thessaloniki, Thessaloniki, Greece
Venue:
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Year:
2003

Citing 8
Cited 0

Alphabetic tree relations

Theoretical Computer Science
Synchronized tree automata

Theoretical Computer Science
On two families of forests

Acta Informatica
Tree languages

Handbook of formal languages, vol. 3
On the size of stack and synchronization alphabets of tree automata

Fundamenta Informaticae
Alphabetic and synchronized tree transducers

Theoretical Computer Science
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Iterated Deterministic Top-Down Look-Ahead

FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the concept of an alphabetic pushdown tree transducer, by adding a stack to an alphabetic tree transducer in the same way as a pushdown tree automaton is obtained from a top-down tree automaton. The stack of the general model contains trees, however, we also consider a restricted model of which the stack contains only unary trees. We give a characterization of the tree transformation induced by a restricted alphabetic pushdown tree transducer in terms of an algebraic forest over a suitable ranked alphabet and a bimorphism.We compare the class of tree relations induced by the alphabetic pushdown tree transducers with known classes of tree transformations. Finally, a new hierarchy of tree relations is established.