Pages that link to "Item:Q5656401"
From MaRDI portal
The following pages link to Translations on a context free grammar (Q5656401):
Displayed 50 items.
- Domains of partial attributed tree transducers (Q294731) (← links)
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Loops and overloops for tree-walking automata (Q442148) (← links)
- Modular tree transducers (Q807012) (← links)
- Tree-walking automata cannot be determinized (Q817841) (← links)
- Complementing deterministic tree-walking automata (Q845667) (← links)
- The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Streaming tree automata (Q975511) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Macro tree transducers (Q1073576) (← links)
- Pushdown machines for the macro tree transducer (Q1089810) (← links)
- High level tree transducers and iterated pushdown tree transducers (Q1096399) (← links)
- Tree transducers, L systems, and two-way machines (Q1136239) (← links)
- Interdependent translation schemes (Q1151758) (← links)
- Pebble machines and tree walking machines (Q1170037) (← links)
- The string generating power of context-free hypergraph grammars (Q1176107) (← links)
- An implementation of syntax directed functional programming on nested- stack machines (Q1194207) (← links)
- Tree transducers with external functions (Q1208712) (← links)
- Are two context-free languages translatable in a syntax-directed translation scheme? (Q1217456) (← links)
- On tree transducers for partial functions (Q1247295) (← links)
- Classes of formal grammars (Q1248342) (← links)
- Interpolazione e smoothing mono e bidimensionali relativi ad operatori differenziali lineari (Q1249415) (← links)
- Trading independent for synchronized parallelism in finite copying parallel rewriting systems (Q1267708) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- Synthesized and inherited functions. A new computational model for syntax-directed semantics (Q1338894) (← links)
- Typechecking for XML transformers (Q1394797) (← links)
- On the power of tree-walking automata. (Q1401944) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- Balancedness of MSO transductions in polynomial time (Q1705700) (← links)
- Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey (Q1736791) (← links)
- Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
- The complexity of the exponential output size problem for top-down and bottom-up tree transducers (Q1854455) (← links)
- Independent parallelism in finite copying parallel rewriting systems (Q1960409) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Automata on finite trees (Q2074209) (← links)
- Backward type inference for XML queries (Q2182320) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← links)
- EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS (Q2909099) (← links)
- CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS (Q3401474) (← links)
- (Q4008193) (← links)
- On coupled languages and translations (Q4131693) (← links)
- Transductions of dags and trees (Q4742320) (← links)
- Three hierarchies of transducers (Q4747534) (← links)
- Conversion and parsing of tree transducers for syntactic pattern analysis (Q4747536) (← links)