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)- Pushdown tree automata
- An implementation of syntax directed functional programming on nested- stack machines
- Decision problems of tree transducers with origin
- Three hierarchies of transducers
- Systolic trees and systolic language recognition by tree automata
- Alphabetic and synchronized tree transducers
- Superlinear deterministic top-down tree transducers
- Tree transformations and dependencies
- scientific article; zbMATH DE number 3744578 (Why is no real title available?)
- Bottom-up and top-down tree transformations— a comparison
- Top-down tree transducers with regular look-ahead
- Cascades of tree-automata and computations in universal algebras
- A survey on decidable equivalence problems for tree transducers
- -Treeautomata and their relation to weighted context-free grammars
- A complete classification of deterministic root-to-frontier tree transformation classes
- Modular tree transducers
- Conversion and parsing of tree transducers for syntactic pattern analysis
- A complete rewriting system for a monoid of tree transformation classes
- Rational languages defined with a non-associative concatenation
- Composition closure of linear extended top-down tree transducers
- Weighted iterated linear control
- scientific article; zbMATH DE number 7644294 (Why is no real title available?)
- Multidimensional trees
- Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
- Designing equivalent semantic models for process creation
- Transductions of dags and trees
- Deterministic top-down tree transducers with iterated look-ahead
- Some results in tree automata
- A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
- A pumping lemma for output languages of macro tree transducers
- Decidability of equivalence for deterministic synchronized tree automata
- Definability results for top-down tree transducers
- Compositions of extended top-down tree transducers
- Augmented transition networks and their relation to tree transducers
- Forward and backward application of symbolic tree transducers
- scientific article; zbMATH DE number 7561353 (Why is no real title available?)
- Definability Results for Top-Down Tree Transducers
- Compositions of constant weighted extended tree transducers
- Morphismes et bimorphismes d'arbres
- Deaccumulation techniques for improving provability
- Un théorème de duplication pour les forets algébriques
- Classes of formal grammars
- Regular Approximation of Weighted Linear Context-Free Tree Languages
- On tree transducers for partial functions
- Top-down tree transducers with two-way tree walking look-ahead
- Look-ahead removal for total deterministic top-down tree transducers
- scientific article; zbMATH DE number 3607504 (Why is no real title available?)
- A hierarchy of deterministic top-down tree transformations
- Decidability of EDT0L structural equivalence
- RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
- Shape preserving top-down tree transducers.
- Intercalation lemmas for tree transducer languages
- Macro tree transducers
- Natural state transformations
- Second-order abstract categorial grammars as hyperedge replacement grammars
- High level tree transducers and iterated pushdown tree transducers
- Pumping lemmas for term languages
- Characterizing Compatible View Updates in Syntactic Bidirectionalization
- From Tree-Based Generators to Delegation Networks
- The generating power of total deterministic tree transducers
- Extended Multi Bottom-Up Tree Transducers
- Undecidable properties of deterministic top-down tree transducers
- Iterated relabeling tree transducers
- Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables
- The equivalence of bottom-up and top-down tree-to-graph transducers
- Top-down tree transducers with deterministic top-down look-ahead
- Synthesized and inherited functions. A new computational model for syntax-directed semantics
- PURE AND O-SUBSTITUTION
- Compositions of Weighted Extended Tree Transducers — The Unambiguous Case
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
- On the equivalence problem for letter-to-letter top-down tree transducers
- Variants of top-down tree transducers with look-ahead
- IO and OI. II
- Survey: Weighted extended top-down tree transducers. III. Composition
- Multiple context-free tree grammars: lexicalization and characterization
- On the complexity of finite, pushdown, and stack automata
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Basic tree transducers
- Linear deterministic multi bottom-up tree transducers
- Alphabetic tree relations
- Branching synchronization grammars with nested tables
- Linearity and nondeletion on monadic context-free tree grammars
- Decision problems of tree transducers with origin
- Le théorème de transversale rationnelle dans les langages d'arbres
- Deciding whether an attributed translation can be realized by a top-down transducer
- Synchronized tree automata
- Functionality of compositions of top-down tree transducers is decidable
- Deciding equivalence of top-down XML transformations in polynomial time
- Pushdown machines for the macro tree transducer
- Extended multi bottom-up tree transducers
- Interdependent translation schemes
- Applications of weighted automata in natural language processing
- The formal power of one-visit attribute grammars
- Generalized sequential machine maps
- Tree-based generation of languages of fractals
- Properties of quasi-relabeling tree bimorphisms
- A generalized approach to formal languages
- IO and OI. I
- Earliest normal form and minimization for bottom-up tree transducers
- Tree adjunct grammars
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)
