Deterministic top-down tree transducers with iterated look-ahead

DOI10.1016/0304-3975(94)00111-UzbMath0873.68137MaRDI QIDQ673068

Giora Slutzki, Sándor Vágvölgyi

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

deterministic top-down tree automata; look-ahead tree languages

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q42: Grammars and rewriting systems

Related Items

A hierarchy of deterministic top-down tree transformations, Branching synchronization grammars with nested tables, Decidability of equivalence for deterministic synchronized tree automata, Storage-to-tree transducers with look-ahead, Decidability of the finiteness of ranges of tree transductions

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Macro tree transducers
• Pushdown machines for the macro tree transducer
• High level tree transducers and iterated pushdown tree transducers
• Tree transducers, L systems, and two-way machines
• Intercalation lemmas for tree transducer languages
• Top-down tree transducers with deterministic top-down look-ahead
• Generalized sequential machine maps
• A syntax directed compiler for ALGOL 60
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• Three hierarchies of transducers
• Mappings and grammars on trees