Mappings and grammars on trees

DOI10.1007/BF01695769zbMATH Open0203.30103MaRDI QIDQ5603192FDOQ5603192

William C. Rounds

Publication date: 1970

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Cites Work

• A syntax directed compiler for ALGOL 60
• Indexed Grammars—An Extension of Context-Free Grammars
• Syntax-Directed Transduction
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Tree acceptors and some of their applications
• Tree generating regular systems
• Algebraic automata and context-free sets
• The minimalization of tree automata
• Title not available (Why is that?)
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Algebra automata I: Parallel programming as a prolegomena to the categorical approach
• Transformations and translations from the point of view of generalized finite automata theory
• Translations on a context free grammar

Cited In (only showing first 100 items - show all)

• Applications of Weighted Automata in Natural Language Processing
• Compositions of extended top-down tree transducers
• Definability Results for Top-Down Tree Transducers
• Forward and backward application of symbolic tree transducers
• RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
• Title not available (Why is that?)
• Morphismes et bimorphismes d'arbres
• Compositions of constant weighted extended tree transducers
• Deaccumulation techniques for improving provability
• Un théorème de duplication pour les forets algébriques
• On tree transducers for partial functions
• Look-ahead removal for total deterministic top-down tree transducers
• Top-down tree transducers with two-way tree walking look-ahead
• Intercalation lemmas for tree transducer languages
• Macro tree transducers
• High level tree transducers and iterated pushdown tree transducers
• Second-order abstract categorial grammars as hyperedge replacement grammars
• Tree Transformations and Dependencies
• From Tree-Based Generators to Delegation Networks
• The generating power of total deterministic tree transducers
• Decision Problems of Tree Transducers with Origin
• Undecidable properties of deterministic top-down tree transducers
• Top-down tree transducers with deterministic top-down look-ahead
• PURE AND O-SUBSTITUTION
• Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
• IO and OI. II
• Linear deterministic multi bottom-up tree transducers
• Deterministic tree pushdown automata and monadic tree rewriting systems
• Basic tree transducers
• Alphabetic tree relations
• Branching synchronization grammars with nested tables
• Linearity and nondeletion on monadic context-free tree grammars
• Synchronized tree automata
• Tree-based generation of languages of fractals
• Deciding equivalence of top-down XML transformations in polynomial time
• Pushdown machines for the macro tree transducer
• Extended multi bottom-up tree transducers
• Generalized sequential machine maps
• The formal power of one-visit attribute grammars
• A generalized approach to formal languages
• IO and OI. I
• Tree adjunct grammars
• Compositions with superlinear deterministic top-down tree transformations
• Tree transducers, L systems, and two-way machines
• Tree transducers with external functions
• Surface tree languages and parallel derivation trees
• Hierarchies of tree series transformations
• Decidability of the finiteness of ranges of tree transductions
• Tree-stack automata
• Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition
• Tree-based picture generation
• wMSO theories as grammar formalisms
• Tree pushdown automata
• Yield-languages recognized by alternating tree recognizers
• Compositions of tree series transformations
• The complexity of the exponential output size problem for top-down and bottom-up tree transducers
• On procedures as open subroutines. II
• The translation power of top-down tree-to-graph transducers
• Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
• Output string languages of compositions of deterministic macro tree transducers
• Closure properties of linear context-free tree languages with an application to optimality theory
• Pushdown tree automata
• Linear context-free tree languages and inverse homomorphisms
• Three hierarchies of transducers
• Superlinear deterministic top-down tree transducers
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS
• A survey on decidable equivalence problems for tree transducers
• A complete classification of deterministic root-to-frontier tree transformation classes
• Modular tree transducers
• A complete rewriting system for a monoid of tree transformation classes
• Composition closure of linear extended top-down tree transducers
• Multidimensional trees
• Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
• Designing equivalent semantic models for process creation
• Deterministic top-down tree transducers with iterated look-ahead
• A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
• Decidability of equivalence for deterministic synchronized tree automata
• Definability results for top-down tree transducers
• Title not available (Why is that?)
• Augmented transition networks and their relation to tree transducers
• Regular Approximation of Weighted Linear Context-Free Tree Languages
• A hierarchy of deterministic top-down tree transformations
• Classes of formal grammars
• Decidability of EDT0L structural equivalence
• Characterizing Compatible View Updates in Syntactic Bidirectionalization
• Shape preserving top-down tree transducers.
• Natural state transformations
• Pumping lemmas for term languages
• Extended Multi Bottom-Up Tree Transducers
• Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables
• Iterated relabeling tree transducers
• The equivalence of bottom-up and top-down tree-to-graph transducers
• Synthesized and inherited functions. A new computational model for syntax-directed semantics
• Compositions of Weighted Extended Tree Transducers — The Unambiguous Case
• Variants of top-down tree transducers with look-ahead
• On the equivalence problem for letter-to-letter top-down tree transducers
• Multiple context-free tree grammars: lexicalization and characterization
• On the complexity of finite, pushdown, and stack automata

Uses Software

• ALGOL 60

This page was built for publication: Mappings and grammars on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5603192)