Deterministic top-down tree transducers with iterated look-ahead

DOI10.1016/0304-3975(94)00111-UMaRDI QIDQ673068zbMATH OpenFDO

Authors Giora Slutzki, Sándor Vágvölgyi

Publication date 28 February 1997

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

Full work available at URL https://doi.org/10.1016/0304-3975(94)00111-U

zbMATH Keywords

deterministic top-down tree automatalook-ahead tree languages

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 17541
• A hierarchy of deterministic top-down tree transformations
• scientific article; zbMATH DE number 522869

Cites work

• A syntax directed compiler for ALGOL 60
• Bottom-up and top-down tree transformations— a comparison
• Generalized sequential machine maps
• High level tree transducers and iterated pushdown tree transducers
• scientific article; zbMATH DE number 17541 (Why is no real title available?)
• scientific article; zbMATH DE number 3501022 (Why is no real title available?)
• scientific article; zbMATH DE number 3558992 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 522869 (Why is no real title available?)
• Intercalation lemmas for tree transducer languages
• Macro tree transducers
• Mappings and grammars on trees
• Pushdown machines for the macro tree transducer
• Three hierarchies of transducers
• Top-down tree transducers with deterministic top-down look-ahead
• Top-down tree transducers with regular look-ahead
• Tree transducers, L systems, and two-way machines

Cited in

(20)

• Deterministic bottom-up tree transducers and ground term rewrite systems
• High level tree transducers and iterated pushdown tree transducers
• Top-down tree transducers with two-way tree walking look-ahead
• Decidability of the finiteness of ranges of tree transductions
• Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
• Top-down tree transducers with deterministic top-down look-ahead
• Deterministic top-down tree automata with Boolean deterministic look-ahead
• scientific article; zbMATH DE number 3905868 (Why is no real title available?)
• scientific article; zbMATH DE number 4041315 (Why is no real title available?)
• Variants of top-down tree transducers with look-ahead
• scientific article; zbMATH DE number 17541 (Why is no real title available?)
• scientific article; zbMATH DE number 522869 (Why is no real title available?)
• A hierarchy of deterministic top-down tree transformations
• Superlinear deterministic top-down tree transducers
• scientific article; zbMATH DE number 1456969 (Why is no real title available?)
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• Look-ahead on pushdowns
• Branching synchronization grammars with nested tables
• Decidability of equivalence for deterministic synchronized tree automata
• Storage-to-tree transducers with look-ahead

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: Deterministic top-down tree transducers with iterated look-ahead

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673068)