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

DOI10.1007/978-3-031-40247-0_17arXiv2306.04326OpenAlexW4385705572MaRDI QIDQ6199878

Martin Vu, Sebastian Maneth

Publication date: 28 February 2024

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2306.04326

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• On tree transducers for partial functions
• Decidability of the finiteness of ranges of tree transductions
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars
• Decision problems of tree transducers with origin
• Macro tree transducers, attribute grammars, and MSO definable tree translations.
• Top-down tree transducers with regular look-ahead
• Macro Tree Translations of Linear Size Increase are MSO Definable
• From Two-Way to One-Way Finite State Transducers
• Semantics of context-free languages

This page was built for publication: Deciding whether an attributed translation can be realized by a top-down transducer