Top-down tree transducers with regular look-ahead
From MaRDI portal
Publication:4146263
DOI10.1007/BF01683280zbMath0369.68048OpenAlexW1988343205MaRDI QIDQ4146263
Publication date: 1977
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01683280
Related Items
An axiomatic approach to the Korenjak-Hopcroft algorithms, Visibly Pushdown Transducers with Look-Ahead, The translation power of top-down tree-to-graph transducers, Compositions of constant weighted extended tree transducers, Definability results for top-down tree transducers, Pushdown machines for the macro tree transducer, Linking theorems for tree transducers, Controlled Term Rewriting, High level tree transducers and iterated pushdown tree transducers, EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS, Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations, A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead, Deterministic top-down tree automata with Boolean deterministic look-ahead, Branching synchronization grammars with nested tables, Sur les générateurs algébriques et linéaires, Compositions with superlinear deterministic top-down tree transformations, The equivalence problem for letter-to-letter bottom-up tree transducers is solvable, Tree transducers, L systems, and two-way machines, Compositions with Constant Weighted Extended Tree Transducers, How to decide functionality of compositions of top-down tree transducers, Transduction from trees to graphs through folding, Translating regular expression matching into transducers, Definability Results for Top-Down Tree Transducers, Functionality of compositions of top-down tree transducers is decidable, Deciding whether an attributed translation can be realized by a top-down transducer, Look-ahead removal for total deterministic top-down tree transducers, A hierarchy of deterministic top-down tree transformations, Balancedness of MSO transductions in polynomial time, 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, Unnamed Item, Decidability of equivalence for a class of non-deterministic tree transducers, Context-free grammars with lookahead, Top-down tree transducers with two-way tree walking look-ahead, Decidability of equivalence for deterministic synchronized tree automata, Copyless cost-register automata: structure, expressiveness, and closure properties, Deterministic top-down tree transducers with iterated look-ahead, Compositions of extended top-down tree transducers, Multiple context-free tree grammars: lexicalization and characterization, Composition closure of linear extended top-down tree transducers, PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS, Variants of top-down tree transducers with look-ahead, Equational tree transformations, Storage-to-tree transducers with look-ahead, Alphabetic and synchronized tree transducers, Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity, Basic tree transducers, Look-ahead on pushdowns, Tree-Series-to-Tree-Series Transformations, Tree-based generation of languages of fractals, On tree transducers for partial functions, Determinacy and rewriting of functional top-down and MSO tree transformations, A Survey on Decidable Equivalence Problems for Tree Transducers, Streaming ranked-tree-to-string transducers, Deciding equivalence of top-down XML transformations in polynomial time, Decidability of the finiteness of ranges of tree transductions, The equivalence of bottom-up and top-down tree-to-graph transducers, Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition, Top-down tree transducers with deterministic top-down look-ahead, Hierarchies of tree series transformations, Extended multi bottom-up tree transducers, Transductions of dags and trees, A comparison of tree transductions defined by monadic second order logic and by attribute grammars, Three hierarchies of transducers, Linear deterministic multi bottom-up tree transducers, Macro tree transducers, attribute grammars, and MSO definable tree translations., A complete classification of deterministic root-to-frontier tree transformation classes, Output string languages of compositions of deterministic macro tree transducers, Erratum to: ``Top-down tree transducers with regular look-ahead, Macro tree transducers
Cites Work
