Pages that link to "Item:Q1854312"

The following pages link to Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312):

Displaying 32 items.

• Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
• Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
• Definable transductions and weighted logics for texts (Q844894) (← links)
• The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
• Look-ahead removal for total deterministic top-down tree transducers (Q906394) (← links)
• Compositions of extended top-down tree transducers (Q948090) (← links)
• Extended multi bottom-up tree transducers (Q1038420) (← links)
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
• Output string languages of compositions of deterministic macro tree transducers (Q1608323) (← links)
• Decision problems of tree transducers with origin (Q1641005) (← links)
• Balancedness of MSO transductions in polynomial time (Q1705700) (← links)
• Copyless cost-register automata: structure, expressiveness, and closure properties (Q1740663) (← links)
• Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
• An operational and denotational approach to non-context-freeness (Q1870568) (← links)
• Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
• XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
• Streamable regular transductions (Q2286735) (← links)
• A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead (Q2390283) (← links)
• Linear deterministic multi bottom-up tree transducers (Q2576876) (← links)
• Deciding origin equivalence of weakly self-nesting macro tree transducers (Q2680223) (← links)
• A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← links)
• Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
• EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS (Q2909099) (← links)
• Tree Transformations and Dependencies (Q3172824) (← links)
• Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
• Extended Multi Bottom-Up Tree Transducers (Q3533019) (← links)
• GETGRATS (Q4923529) (← links)
• A Model-Theoretic Description of Tree Adjoining Grammars1 1The research presented in this paper was supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 441, TP A2. The authors wish to thank Jens Michaelis and Stephan Kepser (Q4923565) (← links)
• Copyful Streaming String Transducers (Q4989167) (← links)
• (Q5089205) (← links)
• Streaming ranked-tree-to-string transducers (Q5918275) (← links)
• Characterizing attributed tree translations in terms of macro tree transducers (Q6104348) (← links)