Pages that link to "Item:Q1136239"
From MaRDI portal
The following pages link to Tree transducers, L systems, and two-way machines (Q1136239):
Displaying 50 items.
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Functional programs as compressed data (Q526441) (← links)
- Basic tree transducers (Q579951) (← links)
- Branching synchronization grammars with nested tables (Q596320) (← links)
- Deterministic top-down tree transducers with iterated look-ahead (Q673068) (← links)
- Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
- Global storage cells for attributes in an attribute grammar (Q761046) (← links)
- The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- The generative power of delegation networks (Q897662) (← links)
- Look-ahead removal for total deterministic top-down tree transducers (Q906394) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Compositions of extended top-down tree transducers (Q948090) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Extended multi bottom-up tree transducers (Q1038420) (← links)
- Hierarchies of hyper-AFLs (Q1058860) (← links)
- Macro tree transducers (Q1073576) (← links)
- Alternating tree automata (Q1077932) (← links)
- Pushdown machines for the macro tree transducer (Q1089810) (← links)
- High level tree transducers and iterated pushdown tree transducers (Q1096399) (← links)
- The OI-hierarchy is closed under control (Q1109578) (← links)
- The copying power of one-state tree transducers (Q1169826) (← links)
- The string generating power of context-free hypergraph grammars (Q1176107) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- Top-down tree transducers with two-way tree walking look-ahead (Q1185007) (← links)
- Trading independent for synchronized parallelism in finite copying parallel rewriting systems (Q1267708) (← links)
- The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
- The generating power of total deterministic tree transducers (Q1281500) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- Undecidable properties of deterministic top-down tree transducers (Q1341717) (← links)
- Yield-languages of two-way pushdown tree automata (Q1352013) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- Tree-based picture generation (Q1583092) (← links)
- Output string languages of compositions of deterministic macro tree transducers (Q1608323) (← links)
- Decision problems of tree transducers with origin (Q1641005) (← 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)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- The power of two-way deterministic checking stack automata (Q1812540) (← links)
- Hierarchies of tree series transformations (Q1826640) (← links)
- Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
- Independent parallelism in finite copying parallel rewriting systems (Q1960409) (← links)
- Word-mappings of level 2 (Q2441544) (← links)
- Linear deterministic multi bottom-up tree transducers (Q2576876) (← links)
- A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS (Q3401474) (← links)
- Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
- Parameter Reduction in Grammar-Compressed Trees (Q3617731) (← links)
