Translations on a context free grammar
From MaRDI portal
Publication:5656401
DOI10.1016/S0019-9958(71)90706-6zbMATH Open0244.68035WikidataQ29010640 ScholiaQ29010640MaRDI QIDQ5656401FDOQ5656401
Publication date: 1972
Published in: Information and Control (Search for Journal in Brave)
Cited In (60)
- Reversibility of computations in graph-walking automata
- On coupled languages and translations
- Classes of formal grammars
- On tree transducers for partial functions
- Macro tree transducers
- High level tree transducers and iterated pushdown tree transducers
- Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey
- The string generating power of context-free hypergraph grammars
- Parameter reduction and automata evaluation for grammar-compressed trees
- Automata on finite trees
- Trading independent for synchronized parallelism in finite copying parallel rewriting systems
- The equivalence of bottom-up and top-down tree-to-graph transducers
- Synthesized and inherited functions. A new computational model for syntax-directed semantics
- A Model-Theoretic Description of Tree Adjoining Grammars1 1The research presented in this paper was supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 441, TP A2. The authors wish to thank Jens Michaelis and Stephan Kepser for helpful comments.
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Automata for XML -- a survey
- Streaming tree automata
- Domains of partial attributed tree transducers
- Loops and Overloops for Tree Walking Automata
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Interpolazione e smoothing mono e bidimensionali relativi ad operatori differenziali lineari
- Loops and overloops for tree-walking automata
- Typechecking for XML transformers
- On the power of tree-walking automata.
- Complementing deterministic tree-walking automata
- The equivalence problem for deterministic MSO tree transducers is decidable
- Deciding equivalence of top-down XML transformations in polynomial time
- Pushdown machines for the macro tree transducer
- Interdependent translation schemes
- Tree-walking automata cannot be determinized
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Tree-walking-storage automata
- Earliest normal form and minimization for bottom-up tree transducers
- Tree transducers, L systems, and two-way machines
- Tree transducers with external functions
- Decidability of the finiteness of ranges of tree transductions
- Pebble machines and tree walking machines
- CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS
- How to decide functionality of compositions of top-down tree transducers
- The complexity of the exponential output size problem for top-down and bottom-up tree transducers
- The translation power of top-down tree-to-graph transducers
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
- Three hierarchies of transducers
- Backward type inference for XML queries
- An implementation of syntax directed functional programming on nested- stack machines
- Independent parallelism in finite copying parallel rewriting systems
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
- A survey on decidable equivalence problems for tree transducers
- Title not available (Why is that?)
- Balancedness of MSO transductions in polynomial time
- Modular tree transducers
- Are two context-free languages translatable in a syntax-directed translation scheme?
- Transductions of dags and trees
- A pumping lemma for output languages of macro tree transducers
- A syntax directed macro processor
- How Hard Is Positive Quantification?
- Functionality of compositions of top-down tree transducers is decidable
- Title not available (Why is that?)
- Classes of Tree Homomorphisms with Decidable Preservation of Regularity
- Conversion and parsing of tree transducers for syntactic pattern analysis
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)