Storage-to-tree transducers with look-ahead

DOI10.1016/J.TCS.2004.08.007zbMATH Open1086.68072OpenAlexW2013626639MaRDI QIDQ706619FDOQ706619

Authors: Tamás Hornung, Sándor Vágvölgyi 

Publication date: 9 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.08.007

Recommendations

• Top-down tree transducers with two-way tree walking look-ahead
• Macro tree transducers
• Variants of top-down tree transducers with look-ahead
• Look-ahead removal for total deterministic top-down tree transducers
• Deterministic top-down tree transducers with iterated look-ahead

zbMATH Keywords

Look-aheadStorage typeTransducerTree grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70)

Cites Work

• Top-down tree transducers with regular look-ahead
• Title not available (Why is that?)
• Top-down tree transducers with deterministic top-down look-ahead
• Deterministic top-down tree transducers with iterated look-ahead
• Macro tree transducers
• Pushdown machines for the macro tree transducer
• Look-ahead on pushdowns
• Top-down tree transducers with two-way tree walking look-ahead
• Title not available (Why is that?)
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars

Cited In (1)

• Reasoning about Translation Lookaside Buffers

This page was built for publication: Storage-to-tree transducers with look-ahead

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