Deterministic top-down tree transducers with iterated look-ahead
From MaRDI portal
Publication:673068
DOI10.1016/0304-3975(94)00111-UzbMATH Open0873.68137MaRDI QIDQ673068FDOQ673068
Authors: Giora Slutzki, Sándor Vágvölgyi
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- A syntax directed compiler for ALGOL 60
- Bottom-up and top-down tree transformations— a comparison
- Top-down tree transducers with regular look-ahead
- Title not available (Why is that?)
- Generalized sequential machine maps
- Mappings and grammars on trees
- Tree transducers, L systems, and two-way machines
- Top-down tree transducers with deterministic top-down look-ahead
- Three hierarchies of transducers
- Macro tree transducers
- High level tree transducers and iterated pushdown tree transducers
- Pushdown machines for the macro tree transducer
- Intercalation lemmas for tree transducer languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (18)
- Deterministic bottom-up tree transducers and ground term rewrite systems
- A hierarchy of deterministic top-down tree transformations
- Top-down tree transducers with two-way tree walking look-ahead
- High level tree transducers and iterated pushdown tree transducers
- Storage-to-tree transducers with look-ahead
- Top-down tree transducers with deterministic top-down look-ahead
- Variants of top-down tree transducers with look-ahead
- Look-ahead on pushdowns
- Branching synchronization grammars with nested tables
- Title not available (Why is that?)
- Decidability of the finiteness of ranges of tree transductions
- Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
- Title not available (Why is that?)
- Superlinear deterministic top-down tree transducers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Synthesis of deterministic top-down tree transducers from automatic tree relations
- Decidability of equivalence for deterministic synchronized tree automata
Uses Software
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)