Translations on a context free grammar
From MaRDI portal
Publication:5656401
DOI10.1016/S0019-9958(71)90706-6zbMath0244.68035WikidataQ29010640 ScholiaQ29010640MaRDI QIDQ5656401
Publication date: 1972
Published in: Information and Control (Search for Journal in Brave)
Related Items
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., How Hard Is Positive Quantification?, The translation power of top-down tree-to-graph transducers, Synthesized and inherited functions. A new computational model for syntax-directed semantics, Domains of partial attributed tree transducers, Pushdown machines for the macro tree transducer, High level tree transducers and iterated pushdown tree transducers, Complementing deterministic tree-walking automata, The equivalence problem for deterministic MSO tree transducers is decidable, EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS, Automata for XML -- a survey, Backward type inference for XML queries, Tree transducers, L systems, and two-way machines, Typechecking for XML transformers, Tree-walking-storage automata, How to decide functionality of compositions of top-down tree transducers, On the power of tree-walking automata., Functionality of compositions of top-down tree transducers is decidable, Interdependent translation schemes, Balancedness of MSO transductions in polynomial time, Parameter reduction and automata evaluation for grammar-compressed trees, Loops and overloops for tree-walking automata, A comparison of boundary graph grammars and context-free hypergraph grammars, Unnamed Item, Independent parallelism in finite copying parallel rewriting systems, Reversibility of computations in graph-walking automata, XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles, Pebble machines and tree walking machines, The string generating power of context-free hypergraph grammars, Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey, An implementation of syntax directed functional programming on nested- stack machines, Tree transducers with external functions, On coupled languages and translations, Are two context-free languages translatable in a syntax-directed translation scheme?, Streaming tree automata, Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity, Loops and Overloops for Tree Walking Automata, On tree transducers for partial functions, Classes of formal grammars, A Survey on Decidable Equivalence Problems for Tree Transducers, Interpolazione e smoothing mono e bidimensionali relativi ad operatori differenziali lineari, Classes of Tree Homomorphisms with Decidable Preservation of Regularity, Unnamed Item, Trading independent for synchronized parallelism in finite copying parallel rewriting systems, Deciding equivalence of top-down XML transformations in polynomial time, Decidability of the finiteness of ranges of tree transductions, The equivalence of bottom-up and top-down tree-to-graph transducers, CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS, Automata on finite trees, Transductions of dags and trees, A comparison of tree transductions defined by monadic second order logic and by attribute grammars, Three hierarchies of transducers, Conversion and parsing of tree transducers for syntactic pattern analysis, Macro tree transducers, attribute grammars, and MSO definable tree translations., The complexity of the exponential output size problem for top-down and bottom-up tree transducers, Modular tree transducers, A syntax directed macro processor, Macro tree transducers, A pumping lemma for output languages of macro tree transducers, Tree-walking automata cannot be determinized
