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)
68Q45: Formal languages and automata
Related Items
Transductions of dags and trees, Three hierarchies of transducers, Conversion and parsing of tree transducers for syntactic pattern analysis, A syntax directed macro processor, Classes of Tree Homomorphisms with Decidable Preservation of Regularity, Modular tree transducers, Tree-walking automata cannot be determinized, Automata for XML -- a survey, A comparison of boundary graph grammars and context-free hypergraph grammars, Deciding equivalence of top-down XML transformations in polynomial time, Macro tree transducers, Pushdown machines for the macro tree transducer, High level tree transducers and iterated pushdown tree transducers, Tree transducers, L systems, and two-way machines, Interdependent translation schemes, Pebble machines and tree walking machines, The string generating power of context-free hypergraph grammars, An implementation of syntax directed functional programming on nested- stack machines, Tree transducers with external functions, Are two context-free languages translatable in a syntax-directed translation scheme?, On tree transducers for partial functions, Classes of formal grammars, Interpolazione e smoothing mono e bidimensionali relativi ad operatori differenziali lineari, Trading independent for synchronized parallelism in finite copying parallel rewriting systems, Decidability of the finiteness of ranges of tree transductions, The equivalence of bottom-up and top-down tree-to-graph transducers, The translation power of top-down tree-to-graph transducers, Synthesized and inherited functions. A new computational model for syntax-directed semantics, Typechecking for XML transformers, On the power of tree-walking automata., A comparison of tree transductions defined by monadic second order logic and by attribute grammars, 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, Independent parallelism in finite copying parallel rewriting systems, Unnamed Item, On coupled languages and translations
