## Macro Tree Translations of Linear Size Increase are MSO Definable (2001)

Venue: | SIAM J. Comput |

Citations: | 16 - 6 self |

### BibTeX

@ARTICLE{Engelfriet01macrotree,

author = {Joost Engelfriet and Sebastian Maneth},

title = {Macro Tree Translations of Linear Size Increase are MSO Definable},

journal = {SIAM J. Comput},

year = {2001},

volume = {32},

pages = {2003}

}

### OpenURL

### Abstract

Abstract. The first main result is that if a macro tree translation is of linear size increase, i.e., if the size of every output tree is linearly bounded by the size of the corresponding input tree, then the translation is MSO definable (i.e., definable in monadic second-order logic). This gives a new characterization of the MSO definable tree translations in terms of macro tree transducers: they are exactly the macro tree translations of linear size increase. The second main result is that given a macro tree transducer, it can be decided whether or not its translation is MSO definable, and if it is then an equivalent MSO transducer can be constructed. Similar results hold for attribute grammars, which define a subclass of the macro tree translations.

### Citations

506 |
Finite Model Theory
- Ebbinghaus, Flum
- 1995
(Show Context)
Citation Context ...inguistics [37, 43]). Motivated by model theory is the idea of “interpretation”, meaning the definition of a (logical) structure in terms of logical formulas over another structure (cf. Chapter 10 of =-=[12]-=-). For monadic secondorder (MSO) logic, such MSO interpretations have recently been used to characterize the generation of graphs by context-free graph grammars [5, 7, 22, 15] (see also [35]). Taking ... |

466 | Semantics of context-free languages
- Knuth
(Show Context)
Citation Context ... tree transducers. Well-known examples of tree transducers are top-down tree transducers [45, 47, 1, 31] and attribute grammars [16, 26, 27] (motivated by syntax-directed semantics and compilers, cf. =-=[34, 36, 39, 52]-=-), unranked tree transducers [42, 2] and pebble tree transducers [44] (motivated by the transformation of XML documents, cf. [50]), and macro tree transducers [14, 8, 23, 27] (motivated by syntax-dire... |

280 |
Descriptive Complexity
- Immerman
- 1999
(Show Context)
Citation Context ...uld be generalized in order to obtain the class of polynomial size increase macro tree translations. (Note that there are wellestablished models of polynomial size increase FO transducers, see, e.g., =-=[12, 33]-=-). Composition of MTTs yields a proper hierarchy, i.e., there are translations which can be realized by the composition of m + 1 MTTs, but not by the composition of m MTTs (Theorem 4.16 of [23]). Now,... |

237 |
Tree Automata. Akadémiai Kiado
- Gécseg, Steinby
- 1984
(Show Context)
Citation Context ....]). We will say that [σ1 ← s1, . . . , σn ← sn ] is a second-order tree substitution over Σ. Note that it is as6 J. ENGELFRIET AND S. MANETH mapping from TΣ to TΣ. In fact, it is a tree homomorphism =-=[30]-=-. Note also that (just as first-order tree substitution) second-order tree substitution is associative (by the closure of tree homomorphisms under composition, cf. Theorem IV.3.7 of [30]), i.e., t[σ ←... |

157 | Type checking for XML transformers
- Milo, Suciu, et al.
- 2000
(Show Context)
Citation Context ...sducers [45, 47, 1, 31] and attribute grammars [16, 26, 27] (motivated by syntax-directed semantics and compilers, cf. [34, 36, 39, 52]), unranked tree transducers [42, 2] and pebble tree transducers =-=[44]-=- (motivated by the transformation of XML documents, cf. [50]), and macro tree transducers [14, 8, 23, 27] (motivated by syntax-directed and denotational semantics [34, 46], and used as a model in, e.g... |

121 |
Mappings and grammars on trees
- Rounds
- 1970
(Show Context)
Citation Context ...on of the operations, i.e., a tree-to-tree transformation. We are interested in models of such transformations: tree transducers. Well-known examples of tree transducers are top-down tree transducers =-=[45, 47, 1, 31]-=- and attribute grammars [16, 26, 27] (motivated by syntax-directed semantics and compilers, cf. [34, 36, 39, 52]), unranked tree transducers [42, 2] and pebble tree transducers [44] (motivated by the ... |

110 |
Macro tree transducers
- Engelfriet, Vogler
- 1985
(Show Context)
Citation Context ...ntics and compilers, cf. [34, 36, 39, 52]), unranked tree transducers [42, 2] and pebble tree transducers [44] (motivated by the transformation of XML documents, cf. [50]), and macro tree transducers =-=[14, 8, 23, 27]-=- (motivated by syntax-directed and denotational semantics [34, 46], and used as a model in, e.g., functional programming [51, 38, 40], language prototyping [48], and linguistics [37, 43]). Motivated b... |

82 |
Compiler Design
- Wilhelm, Maurer
- 1995
(Show Context)
Citation Context ... tree transducers. Well-known examples of tree transducers are top-down tree transducers [45, 47, 1, 31] and attribute grammars [16, 26, 27] (motivated by syntax-directed semantics and compilers, cf. =-=[34, 36, 39, 52]-=-), unranked tree transducers [42, 2] and pebble tree transducers [44] (motivated by the transformation of XML documents, cf. [50]), and macro tree transducers [14, 8, 23, 27] (motivated by syntax-dire... |

81 | A web odyssey: from Codd to XML
- Vianu
- 2001
(Show Context)
Citation Context ...(motivated by syntax-directed semantics and compilers, cf. [34, 36, 39, 52]), unranked tree transducers [42, 2] and pebble tree transducers [44] (motivated by the transformation of XML documents, cf. =-=[50]-=-), and macro tree transducers [14, 8, 23, 27] (motivated by syntax-directed and denotational semantics [34, 46], and used as a model in, e.g., functional programming [51, 38, 40], language prototyping... |

69 |
Syntax-directed semantics: Formal models based on tree transducers
- Fülöp, Vogler
- 1998
(Show Context)
Citation Context ...ree transformation. We are interested in models of such transformations: tree transducers. Well-known examples of tree transducers are top-down tree transducers [45, 47, 1, 31] and attribute grammars =-=[16, 26, 27]-=- (motivated by syntax-directed semantics and compilers, cf. [34, 36, 39, 52]), unranked tree transducers [42, 2] and pebble tree transducers [44] (motivated by the transformation of XML documents, cf.... |

66 |
Top-down tree transducers with regular lookahead
- Engelfriet
- 1977
(Show Context)
Citation Context ...ATT ⊆ T R ◦ MTT R which, by Lemma 3.4, equals T R ◦MTT. Since regular look-ahead can be realized by first running a finite state relabeling, i.e., applying a translation in DBQREL (cf. Theorem 2.6 of =-=[13]-=-), we get the inclusion in DBQREL ◦ T ◦ MTT which is ⊆ DBQREL ◦ MTT by Corollary 4.10 of [23], and thus we have the inclusion in MTT R = MTT.) Theorem 7.5. MSOTT = ATT R ∩ LSI. From the fact that ATT ... |

64 | A formal model for an expressive fragment of XSLT
- Bex, Maneth, et al.
- 2000
(Show Context)
Citation Context ...′(t/w[v′′ ← pv])) ≥ 1, i.e., there is a q ′′ ∈ Q such that q →u,w q ′′ and q ′′ →w,v q ′ . (P5) q contributes ≥ 2 states at u to v if and only if there are r1, r2 ∈ Q such that q →u,v r1, r2. for i ∈ =-=[2]-=-, (P6) Let r ′ 1, r ′ 2 ∈ Q and w as above. If q →u,w r1, r2 and ri →w,v r ′ i then q →u,v r ′ 1, r ′ 2. Let us prove property P6. If r ′ 1 �= r ′ 2 then by P3, q →u,v r ′ 1 and q →u,v r ′ 2, which me... |

57 |
Translations on a context-free grammar
- Aho, Ullman
- 1971
(Show Context)
Citation Context ...on of the operations, i.e., a tree-to-tree transformation. We are interested in models of such transformations: tree transducers. Well-known examples of tree transducers are top-down tree transducers =-=[45, 47, 1, 31]-=- and attribute grammars [16, 26, 27] (motivated by syntax-directed semantics and compilers, cf. [34, 36, 39, 52]), unranked tree transducers [42, 2] and pebble tree transducers [44] (motivated by the ... |

57 |
Attribute grammars and recursive program schemes I
- Courcelle, Franchi-Zannettacci
- 1982
(Show Context)
Citation Context ...ntics and compilers, cf. [34, 36, 39, 52]), unranked tree transducers [42, 2] and pebble tree transducers [44] (motivated by the transformation of XML documents, cf. [50]), and macro tree transducers =-=[14, 8, 23, 27]-=- (motivated by syntax-directed and denotational semantics [34, 46], and used as a model in, e.g., functional programming [51, 38, 40], language prototyping [48], and linguistics [37, 43]). Motivated b... |

56 |
Generalized2 sequential machine maps
- Thatcher
(Show Context)
Citation Context ...on of the operations, i.e., a tree-to-tree transformation. We are interested in models of such transformations: tree transducers. Well-known examples of tree transducers are top-down tree transducers =-=[45, 47, 1, 31]-=- and attribute grammars [16, 26, 27] (motivated by syntax-directed semantics and compilers, cf. [34, 36, 39, 52]), unranked tree transducers [42, 2] and pebble tree transducers [44] (motivated by the ... |

51 |
On attributed tree transducers
- Fülöp
- 1980
(Show Context)
Citation Context ...ree transformation. We are interested in models of such transformations: tree transducers. Well-known examples of tree transducers are top-down tree transducers [45, 47, 1, 31] and attribute grammars =-=[16, 26, 27]-=- (motivated by syntax-directed semantics and compilers, cf. [34, 36, 39, 52]), unranked tree transducers [42, 2] and pebble tree transducers [44] (motivated by the transformation of XML documents, cf.... |

50 |
Composition and evaluation of attribute coupled grammars
- Giegerich
- 1988
(Show Context)
Citation Context ... MSO definable tree translations can be characterized by attribute grammars (more precisely: by attributed tree transducers with look-ahead) that are single use restricted. The single use restriction =-=[32, 29, 38, 40]-=- is interesting, because attribute grammars are closed under left-composition with single use restricted attribute grammars. Our results now imply that given an attributed tree transducer (with look-a... |

48 | Macro tree transducers, attribute grammars, and MSO definable tree translations
- Engelfriet, Maneth
- 1999
(Show Context)
Citation Context ...generation of graphs by context-free graph grammars [5, 7, 22, 15] (see also [35]). Taking trees as logical structure, another type of tree transducer is obtained: the MSO tree transducer, studied in =-=[3, 18]-=- (for strings, see [17]). An important part of tree transducer theory is to compare the formal power of these different models of transformation of tree-structured objects and to provide effective tra... |

40 |
A syntax directed compiler for ALGOL 60
- Irons
- 1961
(Show Context)
Citation Context ... tree transducers. Well-known examples of tree transducers are top-down tree transducers [45, 47, 1, 31] and attribute grammars [16, 26, 27] (motivated by syntax-directed semantics and compilers, cf. =-=[34, 36, 39, 52]-=-), unranked tree transducers [42, 2] and pebble tree transducers [44] (motivated by the transformation of XML documents, cf. [50]), and macro tree transducers [14, 8, 23, 27] (motivated by syntax-dire... |

37 |
Tree transducers, L systems, and twoway machines
- Engelfriet, Rozenberg, et al.
- 1980
(Show Context)
Citation Context ...nd only if it is of linear size increase. Since gsdt schemes are a variation of top-down tree transducers, and tree-walking transducers are closely related to finite copying top-down tree transducers =-=[21]-=-, our result can be viewed as a generalization of the result of [1], from top-down tree transducers to macro tree transducers. In fact, since the proper normal form of a top-down tree transducer is ag... |

36 |
Denotational semantics
- Stoy
- 1977
(Show Context)
Citation Context ..., 2] and pebble tree transducers [44] (motivated by the transformation of XML documents, cf. [50]), and macro tree transducers [14, 8, 23, 27] (motivated by syntax-directed and denotational semantics =-=[34, 46]-=-, and used as a model in, e.g., functional programming [51, 38, 40], language prototyping [48], and linguistics [37, 43]). Motivated by model theory is the idea of “interpretation”, meaning the defini... |

32 | Benefits of tree transducers for optimizing functional programs
- Kuhnemann
- 1998
(Show Context)
Citation Context ...rmation of XML documents, cf. [50]), and macro tree transducers [14, 8, 23, 27] (motivated by syntax-directed and denotational semantics [34, 46], and used as a model in, e.g., functional programming =-=[51, 38, 40]-=-, language prototyping [48], and linguistics [37, 43]). Motivated by model theory is the idea of “interpretation”, meaning the definition of a (logical) structure in terms of logical formulas over ano... |

29 | A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Bloem, Engelfriet
- 2000
(Show Context)
Citation Context ...generation of graphs by context-free graph grammars [5, 7, 22, 15] (see also [35]). Taking trees as logical structure, another type of tree transducer is obtained: the MSO tree transducer, studied in =-=[3, 18]-=- (for strings, see [17]). An important part of tree transducer theory is to compare the formal power of these different models of transformation of tree-structured objects and to provide effective tra... |

28 |
Fundamental Properties of Infinite Trees, Theoret
- Courcelle
- 1983
(Show Context)
Citation Context ...7 of [30]), i.e., t[σ ← s][σ ← s ′ ] = t[σ ← s[σ ← s ′ ]] and if σ ′ �= σ then t[σ ← s][σ ′ ← s ′ ] = t[σ ′ ← s ′ , σ ← s[σ ′ ← s ′ ]], and similarly for the general case (cf. Sections 3.4 and 3.7 of =-=[4]-=-). Let P be a condition on σ and s such that {(σ, s) | P } is a partial function; then we use [[σ ← s | P ] to denote the substitution [L], where L is the list of all σ ← s for which condition P holds... |

27 |
A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars
- Courcelle, Engelfriet
- 1995
(Show Context)
Citation Context ...other structure (cf. Chapter 10 of [12]). For monadic secondorder (MSO) logic, such MSO interpretations have recently been used to characterize the generation of graphs by context-free graph grammars =-=[5, 7, 22, 15]-=- (see also [35]). Taking trees as logical structure, another type of tree transducer is obtained: the MSO tree transducer, studied in [3, 18] (for strings, see [17]). An important part of tree transdu... |

27 |
Increasing modularity and language-independency in automatically generated compilers
- Ganzinger
- 1983
(Show Context)
Citation Context ... MSO definable tree translations can be characterized by attribute grammars (more precisely: by attributed tree transducers with look-ahead) that are single use restricted. The single use restriction =-=[32, 29, 38, 40]-=- is interesting, because attribute grammars are closed under left-composition with single use restricted attribute grammars. Our results now imply that given an attributed tree transducer (with look-a... |

27 | Graphs and decidable transductions based on edge constraints
- Klarlund, Schwartzbach
- 1994
(Show Context)
Citation Context ...ter 10 of [12]). For monadic secondorder (MSO) logic, such MSO interpretations have recently been used to characterize the generation of graphs by context-free graph grammars [5, 7, 22, 15] (see also =-=[35]-=-). Taking trees as logical structure, another type of tree transducer is obtained: the MSO tree transducer, studied in [3, 18] (for strings, see [17]). An important part of tree transducer theory is t... |

19 | MSO definable string transductions and two-way finite-state transducers
- ENGELFRIET, HOOGEBOOM
- 2001
(Show Context)
Citation Context ...ntext-free graph grammars [5, 7, 22, 15] (see also [35]). Taking trees as logical structure, another type of tree transducer is obtained: the MSO tree transducer, studied in [3, 18] (for strings, see =-=[17]-=-). An important part of tree transducer theory is to compare the formal power of these different models of transformation of tree-structured objects and to provide effective translations between these... |

17 | Decidability of the finiteness of ranges of tree transductions
- Drewes, Engelfriet
- 1998
(Show Context)
Citation Context ...of of our first main result, as discussed above), (2) for an MTT it is decidable whether or not it is finite copying (the proof is based on the fact that the finiteness of ranges of MTTs is decidable =-=[11]-=-), and (3) from [18, 3] it follows that given a finite copying MTT, an equivalent MSO tree transducer can be constructed. Note that very often membership in a subclass is undecidable (such as regulari... |

17 | Oostrom, Logical description of context-free graph-languages
- Engelfriet, van
- 1997
(Show Context)
Citation Context ...other structure (cf. Chapter 10 of [12]). For monadic secondorder (MSO) logic, such MSO interpretations have recently been used to characterize the generation of graphs by context-free graph grammars =-=[5, 7, 22, 15]-=- (see also [35]). Taking trees as logical structure, another type of tree transducer is obtained: the MSO tree transducer, studied in [3, 18] (for strings, see [17]). An important part of tree transdu... |

12 | On Minimalist Attribute Grammars and Macro Tree Transducers
- Michaelis, Monnich, et al.
- 2001
(Show Context)
Citation Context ...ducers [14, 8, 23, 27] (motivated by syntax-directed and denotational semantics [34, 46], and used as a model in, e.g., functional programming [51, 38, 40], language prototyping [48], and linguistics =-=[37, 43]-=-). Motivated by model theory is the idea of “interpretation”, meaning the definition of a (logical) structure in terms of logical formulas over another structure (cf. Chapter 10 of [12]). For monadic ... |

11 | The complexity of compositions of deterministic tree transducers
- Maneth
- 2002
(Show Context)
Citation Context ...oof is based on this result. GenerallysMTTS OF LINEAR SIZE INCREASE 55 speaking, complexity issues have not yet been studied in the area of macro tree transducers. A first result in that direction is =-=[41]-=- which shows that for a composition τ of deterministic macro tree translations and an input tree s, the corresponding output tree τ(s) can be computed in time linear in the sum of the sizes of s and t... |

8 | An Operational and Denotational Approach to Non-Context-Freeness
- Kolb, Michaelis, et al.
(Show Context)
Citation Context ...ducers [14, 8, 23, 27] (motivated by syntax-directed and denotational semantics [34, 46], and used as a model in, e.g., functional programming [51, 38, 40], language prototyping [48], and linguistics =-=[37, 43]-=-). Motivated by model theory is the idea of “interpretation”, meaning the definition of a (logical) structure in terms of logical formulas over another structure (cf. Chapter 10 of [12]). For monadic ... |

7 | A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
- Drewes
- 1999
(Show Context)
Citation Context ... use restricted” MTTs and for finite copying MTTs in Corollary 7.3 of [18], and for nondeleting MTTs that are finite copying and linear in the parameters in Theorem 5 of [19] (based on Theorem 8.1 of =-=[9]-=-). Theorem 7.7. The output tree languages of MTTs of linear size increase applied to the regular tree languages are the tree languages generated by (HR or NR) contextfree graph grammars. 7.4. Open Pro... |

7 |
Functional description of the contextual analysis in block-structured programming languages: a case study of tree transducers
- Vogler
- 1991
(Show Context)
Citation Context ...rmation of XML documents, cf. [50]), and macro tree transducers [14, 8, 23, 27] (motivated by syntax-directed and denotational semantics [34, 46], and used as a model in, e.g., functional programming =-=[51, 38, 40]-=-, language prototyping [48], and linguistics [37, 43]). Motivated by model theory is the idea of “interpretation”, meaning the definition of a (logical) structure in terms of logical formulas over ano... |

6 |
The formal power of one-visit attribute grammars
- Engelfriet, File
- 1981
(Show Context)
Citation Context ...ree transformation. We are interested in models of such transformations: tree transducers. Well-known examples of tree transducers are top-down tree transducers [45, 47, 1, 31] and attribute grammars =-=[16, 26, 27]-=- (motivated by syntax-directed semantics and compilers, cf. [34, 36, 39, 52]), unranked tree transducers [42, 2] and pebble tree transducers [44] (motivated by the transformation of XML documents, cf.... |

6 | Tree transducer composition as deforestation method for functional programs
- Kühnemann, Voigtländer
- 2001
(Show Context)
Citation Context ...rmation of XML documents, cf. [50]), and macro tree transducers [14, 8, 23, 27] (motivated by syntax-directed and denotational semantics [34, 46], and used as a model in, e.g., functional programming =-=[51, 38, 40]-=-, language prototyping [48], and linguistics [37, 43]). Motivated by model theory is the idea of “interpretation”, meaning the definition of a (logical) structure in terms of logical formulas over ano... |

4 |
Recursive structured document transformations
- Maneth, Neven
- 2000
(Show Context)
Citation Context ...e transducers are top-down tree transducers [45, 47, 1, 31] and attribute grammars [16, 26, 27] (motivated by syntax-directed semantics and compilers, cf. [34, 36, 39, 52]), unranked tree transducers =-=[42, 2]-=- and pebble tree transducers [44] (motivated by the transformation of XML documents, cf. [50]), and macro tree transducers [14, 8, 23, 27] (motivated by syntax-directed and denotational semantics [34,... |

2 |
properties of context-free sets of graphs generated by vertex replacement
- Structural
- 1995
(Show Context)
Citation Context ... that is independent of the device that defines the whole class, i.e., a “semantic” rather than “syntactic” characterization, such as our linear size increase characterization. As another example, in =-=[6]-=- it is shown that an NR (node replacement) context-free graph language can be generated by an HR (hyperedge replacement) context-free graph grammar if and only if the number of edges of its graphs is ... |

2 |
Origin tracking and its applications
- Deursen, Klint, et al.
- 1996
(Show Context)
Citation Context ...ion of ‘finite contribution’. Intuitively, an MTT R is of finite contribution if there is a bound on the number of output nodes contributed by a single node u of the input tree. In the terminology of =-=[49]-=-, the node u is called the ‘origin’ of the nodes of the output tree that it contributes; so, finite contribution means that there is a bound on the number of nodes that have the same origin. In [49] i... |

1 |
level tree transducers and iterated pushdown tree transducers
- High
- 1988
(Show Context)
Citation Context ...rchy, but rather it remains the class of MSO definable tree translations, i.e., is LSI ∩ � n MTT n = MSOTT ? Since compositions of MTTs can be realized by high-level tree transducers (and vice versa) =-=[24]-=- this question is equivalent to: Are linear size increase high-level tree translations MSO definable? Again, this question could also be considered for polynomial instead of linear size increase. Rece... |