Variants of top-down tree transducers with look-ahead

DOI10.1007/BF02088010zbMath0676.68035MaRDI QIDQ3832064

Sándor Vágvölgyi, Zoltán Fülöp

Publication date: 1988

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

tree transformationstree automatatree languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

The equivalence problem for letter-to-letter bottom-up tree transducers is solvable ⋮ A hierarchy of deterministic top-down tree transformations ⋮ Decidability of equivalence for deterministic synchronized tree automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A representation of trees by languages. II
• On tree transducers for partial functions
• Top-down tree transducers with deterministic top-down look-ahead
• Generalizations of regular sets and their application to a study of context-free languages
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• Composition of top-down and bottom-up tree transductions
• Mappings and grammars on trees