When is a bottom-up deterministic tree translation top-down deterministic?

DOI10.4230/LIPICS.ICALP.2020.134MaRDI QIDQ6842436zbMATH OpenFDO

Authors Sebastian Maneth, Helmut Seidl

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2020.134

zbMATH Keywords

earliest transformationlinear transducersremoval of inspectionremoval of look-aheadtop-down tree transducersuniform-copying transucers

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Bottom-up and top-down tree transformations— a comparison
• Countable nondeterminism and random assignment
• Decision problems of tree transducers with origin
• Determinization of transducers over finite and infinite words.
• Generalized sequential machine maps
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• Linking theorems for tree transducers
• Look-ahead removal for total deterministic top-down tree transducers
• Mappings and grammars on trees
• Top-down tree transducers with regular look-ahead
• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles

Cited in

(1)

• Deciding whether an attributed translation can be realized by a top-down transducer

This page was built for publication: When is a bottom-up deterministic tree translation top-down deterministic?

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