Translations on a context free grammar
From MaRDI portal
Publication:5656401
Cited in
(60)- Classes of Tree Homomorphisms with Decidable Preservation of Regularity
- Functionality of compositions of top-down tree transducers is decidable
- scientific article; zbMATH DE number 7456062 (Why is no real title available?)
- Conversion and parsing of tree transducers for syntactic pattern analysis
- How hard is positive quantification?
- A syntax directed macro processor
- Tree transducers, L systems, and two-way machines
- Tree-walking automata cannot be determinized
- Complementing deterministic tree-walking automata
- The string generating power of context-free hypergraph grammars
- An implementation of syntax directed functional programming on nested- stack machines
- Reversibility of computations in graph-walking automata
- Trading independent for synchronized parallelism in finite copying parallel rewriting systems
- The equivalence of bottom-up and top-down tree-to-graph transducers
- Tree transducers with external functions
- Independent parallelism in finite copying parallel rewriting systems
- A survey on decidable equivalence problems for tree transducers
- Streaming tree automata
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- The complexity of the exponential output size problem for top-down and bottom-up tree transducers
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Interpolazione e smoothing mono e bidimensionali relativi ad operatori differenziali lineari
- On coupled languages and translations
- Loops and overloops for tree walking automata
- A model theoretic description of tree adjoining grammars
- Parameter reduction and automata evaluation for grammar-compressed trees
- A pumping lemma for output languages of macro tree transducers
- scientific article; zbMATH DE number 60388 (Why is no real title available?)
- The equivalence problem for deterministic MSO tree transducers is decidable
- Loops and overloops for tree-walking automata
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- The translation power of top-down tree-to-graph transducers
- Macro tree transducers
- Classes of formal grammars
- Automata for XML -- a survey
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
- Decidability of the finiteness of ranges of tree transductions
- Modular tree transducers
- Deciding equivalence of top-down XML transformations in polynomial time
- Pebble machines and tree walking machines
- On tree transducers for partial functions
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
- Synthesized and inherited functions. A new computational model for syntax-directed semantics
- Pushdown machines for the macro tree transducer
- High level tree transducers and iterated pushdown tree transducers
- Automata on finite trees
- Tree-walking-storage automata
- Earliest normal form and minimization for bottom-up tree transducers
- How to decide functionality of compositions of top-down tree transducers
- Interdependent translation schemes
- Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey
- Three hierarchies of transducers
- Typechecking for XML transformers
- Domains of partial attributed tree transducers
- Context-free grammars with linked nonterminals
- On the power of tree-walking automata.
- Balancedness of MSO transductions in polynomial time
- Are two context-free languages translatable in a syntax-directed translation scheme?
- Transductions of dags and trees
- Backward type inference for XML queries
This page was built for publication: Translations on a context free grammar
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5656401)
