The following pages link to IO and OI. I (Q1241985):
Displaying 38 items.
- The equivalence of tree adjoining grammars and monadic linear context-free tree grammars (Q438589) (← links)
- Composition closure of linear extended top-down tree transducers (Q519891) (← links)
- Equational tree transformations (Q551198) (← links)
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations (Q557898) (← links)
- Branching synchronization grammars with nested tables (Q596320) (← links)
- Equational weighted tree transformations (Q766185) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- Compositions of tree series transformations (Q860891) (← links)
- The generative power of delegation networks (Q897662) (← links)
- Second-order abstract categorial grammars as hyperedge replacement grammars (Q972434) (← links)
- R-fuzzy computation (Q1072368) (← links)
- High level tree transducers and iterated pushdown tree transducers (Q1096399) (← links)
- Languages with homomorphic replacements (Q1156494) (← links)
- The formal power of one-visit attribute grammars (Q1157968) (← links)
- Alphabetic tree relations (Q1193896) (← links)
- Extended linear macro grammars, iteration grammars, and register programs (Q1247747) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- Attributed tree grammars (Q1311961) (← links)
- Transducers and the decidability of independence in free monoids (Q1341744) (← links)
- Tree-based picture generation (Q1583092) (← links)
- Decidability of EDT0L structural equivalence (Q1605312) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Hierarchies of tree series transformations (Q1826640) (← links)
- Pushdown tree automata, algebraic tree systems, and algebraic tree series (Q1854412) (← links)
- An operational and denotational approach to non-context-freeness (Q1870568) (← links)
- Principal abstract families of weighted tree languages (Q2064529) (← links)
- Weighted automata with storage (Q2280328) (← links)
- Closure properties of linear context-free tree languages with an application to optimality theory (Q2368942) (← links)
- Towards more precise rewriting approximations (Q2424681) (← links)
- Recognizability of graph and pattern languages (Q2491214) (← links)
- On the Mild Context-Sensitivity of k-Tree Wrapping Grammar (Q2835045) (← links)
- Unique, guarded fixed points in an additive setting (Q2842814) (← links)
- Minimality in a Linear Calculus with Iteration (Q2873683) (← links)
- Equational Weighted Tree Transformations with Discounting (Q3098036) (← links)
- (Q3386623) (← links)
- From Tree-Based Generators to Delegation Networks (Q3522858) (← links)
- Extending regular expressions with homomorphic replacement (Q3566350) (← links)
- Two Equivalent Regularizations for Tree Adjoining Grammars (Q3618604) (← links)
