Pages that link to "Item:Q4102764"

The following pages link to Bottom-up and top-down tree transformations— a comparison (Q4102764):

Displaying 50 items.

• Erratum to: ``Top-down tree transducers with regular look-ahead'' (Q255287) (← links)
• Forward and backward application of symbolic tree transducers (Q404011) (← links)
• Composition closure of linear extended top-down tree transducers (Q519891) (← links)
• Functional programs as compressed data (Q526441) (← links)
• Equational tree transformations (Q551198) (← links)
• Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations (Q557898) (← links)
• Basic tree transducers (Q579951) (← links)
• Branching synchronization grammars with nested tables (Q596320) (← links)
• Deterministic top-down tree transducers with iterated look-ahead (Q673068) (← links)
• A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
• Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
• Equational weighted tree transformations (Q766185) (← links)
• Modular tree transducers (Q807012) (← links)
• A complete classification of deterministic root-to-frontier tree transformation classes (Q807029) (← links)
• Defining syntax-directed translations by tree bimorphisms (Q840769) (← links)
• Weighted tree automata and weighted logics (Q860890) (← links)
• Compositions of tree series transformations (Q860891) (← links)
• Deaccumulation techniques for improving provability (Q882487) (← links)
• A complete rewriting system for a monoid of tree transformation classes (Q918216) (← links)
• Compositions of extended top-down tree transducers (Q948090) (← links)
• Extended multi bottom-up tree transducers (Q1038420) (← links)
• An effectively given initial semigroup (Q1061863) (← links)
• Macro tree transducers (Q1073576) (← links)
• Alternating tree automata (Q1077932) (← links)
• Pushdown machines for the macro tree transducer (Q1089810) (← links)
• High level tree transducers and iterated pushdown tree transducers (Q1096399) (← links)
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
• Compositions with superlinear deterministic top-down tree transformations (Q1127541) (← links)
• Tree transducers, L systems, and two-way machines (Q1136239) (← links)
• A representation of trees by languages. II (Q1137390) (← links)
• The formal power of one-visit attribute grammars (Q1157968) (← links)
• Attribute grammars and recursive program schemes. I. II (Q1162363) (← links)
• Morphismes et bimorphismes d'arbres (Q1165018) (← links)
• The copying power of one-state tree transducers (Q1169826) (← links)
• Generalized automata on infinite trees and Muller-McNaughton's theorem (Q1178688) (← links)
• Top-down tree transducers with two-way tree walking look-ahead (Q1185007) (← links)
• Alphabetic tree relations (Q1193896) (← links)
• An implementation of syntax directed functional programming on nested- stack machines (Q1194207) (← links)
• Tree transducers with external functions (Q1208712) (← links)
• Copying theorems (Q1224420) (← links)
• Surface tree languages and parallel derivation trees (Q1233730) (← links)
• Intercalation lemmas for tree transducer languages (Q1237574) (← links)
• Augmented transition networks and their relation to tree transducers (Q1238432) (← links)
• IO and OI. I (Q1241985) (← links)
• IO and OI. II (Q1243578) (← links)
• A representation of trees by languages. I (Q1246271) (← links)
• On tree transducers for partial functions (Q1247295) (← links)
• Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
• The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
• General varieties of tree languages (Q1275067) (← links)