Composition of top-down and bottom-up tree transductions
From MaRDI portal
Publication:4195956
DOI10.1016/S0019-9958(79)90561-8zbMath0408.68053OpenAlexW1994920572MaRDI QIDQ4195956
Publication date: 1979
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(79)90561-8
Related Items
Undecidable properties of deterministic top-down tree transducers, Defining syntax-directed translations by tree bimorphisms, A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead, Compositions of tree series transformations, Branching synchronization grammars with nested tables, Compositions with superlinear deterministic top-down tree transformations, Tree transducers, L systems, and two-way machines, Forward and backward application of symbolic tree transducers, Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms, How to decide functionality of compositions of top-down tree transducers, Functionality of compositions of top-down tree transducers is decidable, A complete rewriting system for a monoid of tree transformation classes, Extended Multi Bottom-Up Tree Transducers, The copying power of one-state tree transducers, Compositions of Tree-to-Tree Statistical Machine Translation Models, A complete description for a monoid of deterministic bottom-up tree transformation classes, Superlinear deterministic top-down tree transducers, Compositions of extended top-down tree transducers, The use of tree transducers to compute translations between graph algebras, Multiple context-free tree grammars: lexicalization and characterization, PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS, Variants of top-down tree transducers with look-ahead, Alphabetic and synchronized tree transducers, Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations, Decidability of the finiteness of ranges of tree transductions, The equivalence of bottom-up and top-down tree-to-graph transducers, Principal abstract families of weighted tree languages, Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition, A Single Movement Normal Form for Minimalist Grammars, Hierarchies of tree series transformations, Extended multi bottom-up tree transducers, Transductions of dags and trees, Three hierarchies of transducers, Linear deterministic multi bottom-up tree transducers, A complete classification of deterministic root-to-frontier tree transformation classes, Macro tree transducers
