Streaming Tree Transducers

DOI10.1007/978-3-642-31585-5_8zbMath1367.68157arXiv1104.2599OpenAlexW2764317813MaRDI QIDQ3166998

Loris D'Antoni, Rajeev Alur

Publication date: 1 November 2012

Published in: Journal of the ACM, Automata, Languages, and Programming (Search for Journal in Brave)

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

zbMATH Keywords

tree transducersnested words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (14)

Look-ahead removal for total deterministic top-down tree transducers ⋮ Copyless cost-register automata: structure, expressiveness, and closure properties ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Determinacy and rewriting of functional top-down and MSO tree transformations ⋮ Streamable regular transductions ⋮ Regular Programming for Quantitative Properties of Data Streams ⋮ Streaming ranked-tree-to-string transducers ⋮ Regular Transformations of Data Words Through Origin Information ⋮ Regular transducer expressions for regular transformations ⋮ Copyful Streaming String Transducers

This page was built for publication: Streaming Tree Transducers