Characterizing attributed tree translations in terms of macro tree transducers
From MaRDI portal
Publication:6104348
DOI10.1016/j.tcs.2023.113943arXiv2209.07090MaRDI QIDQ6104348
No author found.
Publication date: 15 June 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.07090
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Macro tree transducers
- A characterization of attributed tree transformations by a subclass of macro tree transducers
- Attribute grammars and recursive program schemes. I. II
- Typechecking for XML transformers
- A comparison of pebble tree transducers with macro tree transducers
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable
- Semantics of context-free languages
- Semantics of context-free languages: Correction