Mappings and grammars on trees
From MaRDI portal
Publication:5603192
Cites work
- scientific article; zbMATH DE number 3301432 (Why is no real title available?)
- A syntax directed compiler for ALGOL 60
- Algebra automata I: Parallel programming as a prolegomena to the categorical approach
- Algebraic automata and context-free sets
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Indexed Grammars—An Extension of Context-Free Grammars
- Syntax-Directed Transduction
- The minimalization of tree automata
- Transformations and translations from the point of view of generalized finite automata theory
- Translations on a context free grammar
- Tree acceptors and some of their applications
- Tree generating regular systems
Cited in
(only showing first 100 items - show all)- Tree transducers, L systems, and two-way machines
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Properties of quasi-relabeling tree bimorphisms
- Applications of weighted automata in natural language processing
- The formal power of one-visit attribute grammars
- Morphismes et bimorphismes d'arbres
- scientific article; zbMATH DE number 3607504 (Why is no real title available?)
- RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
- Definability Results for Top-Down Tree Transducers
- Basic tree transducers
- Tree transducers with external functions
- Synchronized tree automata
- A survey on decidable equivalence problems for tree transducers
- Intercalation lemmas for tree transducer languages
- Compositions of constant weighted extended tree transducers
- Deaccumulation techniques for improving provability
- Undecidable properties of deterministic top-down tree transducers
- The complexity of the exponential output size problem for top-down and bottom-up tree transducers
- Tree-based picture generation
- Tree pushdown automata
- Bottom-up and top-down tree transformations— a comparison
- Top-down tree transducers with deterministic top-down look-ahead
- Surface tree languages and parallel derivation trees
- Survey: Weighted extended top-down tree transducers. III. Composition
- Hierarchies of tree series transformations
- PURE AND O-SUBSTITUTION
- Multidimensional trees
- Un théorème de duplication pour les forets algébriques
- Decidability of equivalence for deterministic synchronized tree automata
- Pushdown tree automata
- A complete rewriting system for a monoid of tree transformation classes
- Forward and backward application of symbolic tree transducers
- On procedures as open subroutines. II
- The translation power of top-down tree-to-graph transducers
- IO and OI. II
- Tree-based generation of languages of fractals
- Macro tree transducers
- Top-down tree transducers with regular look-ahead
- Alphabetic tree relations
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
- Decidability of the finiteness of ranges of tree transductions
- Extended Multi Bottom-Up Tree Transducers
- A complete classification of deterministic root-to-frontier tree transformation classes
- Modular tree transducers
- Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
- Deciding equivalence of top-down XML transformations in polynomial time
- Superlinear deterministic top-down tree transducers
- A generalized approach to formal languages
- On tree transducers for partial functions
- IO and OI. I
- Designing equivalent semantic models for process creation
- Pushdown machines for the macro tree transducer
- The generating power of total deterministic tree transducers
- wMSO theories as grammar formalisms
- Tree adjunct grammars
- High level tree transducers and iterated pushdown tree transducers
- Second-order abstract categorial grammars as hyperedge replacement grammars
- Compositions with superlinear deterministic top-down tree transformations
- Yield-languages recognized by alternating tree recognizers
- Extended multi bottom-up tree transducers
- Compositions of extended top-down tree transducers
- Look-ahead removal for total deterministic top-down tree transducers
- Composition closure of linear extended top-down tree transducers
- Closure properties of linear context-free tree languages with an application to optimality theory
- Deterministic top-down tree transducers with iterated look-ahead
- Output string languages of compositions of deterministic macro tree transducers
- From Tree-Based Generators to Delegation Networks
- Three hierarchies of transducers
- Top-down tree transducers with two-way tree walking look-ahead
- Definability results for top-down tree transducers
- Decision problems of tree transducers with origin
- A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
- Tree-stack automata
- Compositions of tree series transformations
- Branching synchronization grammars with nested tables
- Linearity and nondeletion on monadic context-free tree grammars
- Tree transformations and dependencies
- Generalized sequential machine maps
- Linear deterministic multi bottom-up tree transducers
- A hierarchy of deterministic top-down tree transformations
- Un théorème de Chomsky-Schützenberger pour les forets algébriques
- An implementation of syntax directed functional programming on nested- stack machines
- Shape preserving top-down tree transducers.
- The equivalence of bottom-up and top-down tree-to-graph transducers
- scientific article; zbMATH DE number 7644294 (Why is no real title available?)
- On two families of forests
- scientific article; zbMATH DE number 3744578 (Why is no real title available?)
- DECIDABILITY OF THE SHAPE PRESERVING PROPERTY OF BOTTOM-UP TREE TRANSDUCERS
- Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables
- -Treeautomata and their relation to weighted context-free grammars
- Rational languages defined with a non-associative concatenation
- Alphabetic and synchronized tree transducers
- A pumping lemma for output languages of macro tree transducers
- Variants of top-down tree transducers with look-ahead
- Weighted iterated linear control
- Composing stack-attributed tree transducers
- Functionality of compositions of top-down tree transducers is decidable
- Classes of formal grammars
- Natural state transformations
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)
