Affiliation:
1. University of Pennsylvania, Philadelphia, PA
2. University of Wisconsin–Madison, Madison, USA
Abstract
The theory of tree transducers provides a foundation for understanding expressiveness and complexity of analysis problems for specification languages for transforming hierarchically structured data such as XML documents. We introduce
streaming tree transducers
as an analyzable, executable, and expressive model for transforming unranked ordered trees (and forests) in a single pass. Given a linear encoding of the input tree, the transducer makes a single left-to-right pass through the input, and computes the output in linear time using a finite-state control, a visibly pushdown stack, and a finite number of variables that store output chunks that can be combined using the operations of string-concatenation and tree-insertion. We prove that the expressiveness of the model coincides with transductions definable using monadic second-order logic (MSO). Existing models of tree transducers either cannot implement all MSO-definable transformations, or require
regular look-ahead
that prohibits single-pass implementation. We show a variety of analysis problems such as
type-checking
and checking
functional equivalence
are decidable for our model.
Funder
NSF Expeditions in Computing
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference36 articles.
1. Adding nesting structure to words
2. A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars
3. H. Comon M. Dauchet R. Gilleron D. Lugiez S. Tison and M. Tommasi. 2002. Tree automata techniques and applications. Retrieved from http://www.grappa.univ-lille3.fr/tata/. H. Comon M. Dauchet R. Gilleron D. Lugiez S. Tison and M. Tommasi. 2002. Tree automata techniques and applications. Retrieved from http://www.grappa.univ-lille3.fr/tata/.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Folding interpretations;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. Regular transducer expressions for regular transformations;Information and Computation;2022-01
3. Streaming ranked-tree-to-string transducers;Theoretical Computer Science;2021-05
4. First-order tree-to-tree functions;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
5. Streamable regular transductions;Theoretical Computer Science;2020-02