Top-down tree transducers with deterministic top-down look-ahead

DOI10.1016/0020-0190(89)90178-6zbMath0684.68077MaRDI QIDQ1825674

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

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90178-6

zbMATH Keywords

tree transducers; regular look-ahead; deterministic top-down look-ahead; finite state tree transducer; finite tree automaton

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

A hierarchy of deterministic top-down tree transformations, Alphabetic and synchronized tree transducers, Branching synchronization grammars with nested tables, Decidability of equivalence for deterministic synchronized tree automata, Deterministic top-down tree transducers with iterated look-ahead, Storage-to-tree transducers with look-ahead, A complete rewriting system for a monoid of tree transformation classes, Deciding equivalence of top-down XML transformations in polynomial time, Top-down tree transducers with two-way tree walking look-ahead, Decidability of the finiteness of ranges of tree transductions, Synchronized tree automata, The translation power of top-down tree-to-graph transducers, Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations, A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead, Variants of top-down tree transducers with look-ahead

Cites Work

• On tree transducers for partial functions
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• Mappings and grammars on trees