Abstract. The concept of top-down tree transducers is known since decades and the purpose of this paper is to give a smooth introduction into this concept. Within this context, we consider the notion of copying, a copying normal form and a corresponding algorithm. This leads to the presentation of the intercalation lemma that is used to establish a language hierarchy on a special class of tree transducers with respect to the copying-bound parameter.
International audienceWe study a subclass of tree-to-word transducers: linear tree-to-word transduce...
AbstractDecidability questions concerning ranges of deterministic top-down tree transducers are cons...
Abstract Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are p...
We develop intercalation lemmas for the computations of the top-down tree transducers defined by Rou...
AbstractOne-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle “pr...
One-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle "prime copy...
We develop intercalation lemmas for the computations of the top-down tree transducers defined by Rou...
One-state deterministic top-down transducers (or tree homomorphisms) cannot handle ''prime copying'...
Tree transducers (automata which read finite labeled trees and output finite labeled trees) are used...
AbstractOne-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle “pr...
AbstractThe concept of basic tree transducer is investigated; it is obtained as a natural restrictio...
Attributed tree transducers are abstract models to study properties of attribute grammars. One abstr...
Long version of Lata 14 paperWe introduce a class of deterministic sequential top-down tree-to-word ...
Long version of Lata 14 paperWe introduce a class of deterministic sequential top-down tree-to-word ...
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such...
International audienceWe study a subclass of tree-to-word transducers: linear tree-to-word transduce...
AbstractDecidability questions concerning ranges of deterministic top-down tree transducers are cons...
Abstract Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are p...
We develop intercalation lemmas for the computations of the top-down tree transducers defined by Rou...
AbstractOne-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle “pr...
One-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle "prime copy...
We develop intercalation lemmas for the computations of the top-down tree transducers defined by Rou...
One-state deterministic top-down transducers (or tree homomorphisms) cannot handle ''prime copying'...
Tree transducers (automata which read finite labeled trees and output finite labeled trees) are used...
AbstractOne-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle “pr...
AbstractThe concept of basic tree transducer is investigated; it is obtained as a natural restrictio...
Attributed tree transducers are abstract models to study properties of attribute grammars. One abstr...
Long version of Lata 14 paperWe introduce a class of deterministic sequential top-down tree-to-word ...
Long version of Lata 14 paperWe introduce a class of deterministic sequential top-down tree-to-word ...
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such...
International audienceWe study a subclass of tree-to-word transducers: linear tree-to-word transduce...
AbstractDecidability questions concerning ranges of deterministic top-down tree transducers are cons...
Abstract Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are p...