The following pages link to IO and OI. II (Q1243578):
Displaying 46 items.
- A connection between concurrency and language theory (Q265802) (← links)
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations (Q557898) (← links)
- Basic tree transducers (Q579951) (← links)
- Look-ahead on pushdowns (Q579952) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Equational weighted tree transformations (Q766185) (← links)
- All solutions of a system of recursion equations in infinite trees and other contraction theories (Q791310) (← links)
- Implementation of data types by algebraic methods (Q792753) (← links)
- Modular tree transducers (Q807012) (← links)
- The generative power of delegation networks (Q897662) (← links)
- A Mezei-Wright theorem for categorical algebras (Q1044831) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- Hierarchies of hyper-AFLs (Q1058860) (← links)
- Extended macro grammars and stack controlled machines (Q1064075) (← links)
- Macro tree transducers (Q1073576) (← links)
- Pushdown machines for the macro tree transducer (Q1089810) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- Algebraic solutions to recursion schemes (Q1098617) (← links)
- Parameter-reduction of higher level grammars (Q1099634) (← links)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
- The OI-hierarchy is closed under control (Q1109578) (← links)
- Deterministic tree pushdown automata and monadic tree rewriting systems (Q1118421) (← links)
- Tree transducers, L systems, and two-way machines (Q1136239) (← links)
- DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
- The IO- and OI-hierarchies (Q1161273) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- On the expressive power of finitely typed and universally polymorphic recursive procedures (Q1185006) (← links)
- Tree transducers with external functions (Q1208712) (← links)
- A representation of trees by languages. I (Q1246271) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- Attributed tree grammars (Q1311961) (← links)
- Synchronized tree automata (Q1325832) (← links)
- Tree-based picture generation (Q1583092) (← links)
- Decidability of EDT0L structural equivalence (Q1605312) (← links)
- Output string languages of compositions of deterministic macro tree transducers (Q1608323) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Approximation properties of abstract data types (Q1838281) (← links)
- An operational and denotational approach to non-context-freeness (Q1870568) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Principal abstract families of weighted tree languages (Q2064529) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- Linear context-free tree languages and inverse homomorphisms (Q2280337) (← links)
- Closure properties of linear context-free tree languages with an application to optimality theory (Q2368942) (← links)
- Towards more precise rewriting approximations (Q2424681) (← links)
- (Q3386623) (← links)
