Streaming Tree Transducers
From MaRDI portal
Publication:3166998
DOI10.1007/978-3-642-31585-5_8zbMath1367.68157arXiv1104.2599MaRDI QIDQ3166998
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
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Copyful Streaming String Transducers, Streaming ranked-tree-to-string transducers, Determinacy and rewriting of functional top-down and MSO tree transformations, 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, Regular transducer expressions for regular transformations, Streamable regular transductions, Regular Programming for Quantitative Properties of Data Streams, Regular Transformations of Data Words Through Origin Information