The following pages link to The IO- and OI-hierarchies (Q1161273):
Displaying 50 items.
- The grammar of mammalian brain capacity (Q290555) (← links)
- On the effect of the IO-substitution on the Parikh image of semilinear full AFLs (Q302175) (← links)
- Krivine machines and higher-order schemes (Q476196) (← links)
- Functional programs as compressed data (Q526441) (← 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)
- Wythoff games, continued fractions, cedar trees and Fibonacci searches (Q761983) (← links)
- Correctness of programs with Pascal-like procedures without global variables (Q790607) (← links)
- The generative power of delegation networks (Q897662) (← links)
- On the membership problem for non-linear abstract categorial grammars (Q972435) (← links)
- Fundamental properties of infinite trees (Q1055184) (← 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)
- 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)
- The OI-hierarchy is closed under control (Q1109578) (← links)
- On rational definitions in complete algebras without rank (Q1171374) (← links)
- Multidimensional trees (Q1178697) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- On the expressive power of finitely typed and universally polymorphic recursive procedures (Q1185006) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- Transducers and the decidability of independence in free monoids (Q1341744) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- The evaluation of first-order substitution is monadic second-order compatible (Q1603690) (← links)
- Output string languages of compositions of deterministic macro tree transducers (Q1608323) (← links)
- On the \(\lambda Y\) calculus (Q1886326) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- General decidability results for asynchronous shared-memory programs: higher-order and beyond (Q2044219) (← links)
- Principal abstract families of weighted tree languages (Q2064529) (← links)
- Weighted automata with storage (Q2280328) (← links)
- The IO and OI hierarchies revisited (Q2347807) (← links)
- MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies (Q2353402) (← links)
- On Boolean closed full trios and rational Kripke frames (Q2363961) (← links)
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable (Q2422040) (← links)
- Iterated pushdown automata and sequences of rational numbers (Q2498918) (← links)
- A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← links)
- Model-Checking Games for Typed λ-Calculi (Q2864164) (← links)
- Simply typed fixpoint calculus and collapsible pushdown automata (Q2973243) (← links)
- Krivine Machines and Higher-Order Schemes (Q3012917) (← links)
- Variable Tree Automata over Infinite Ranked Alphabets (Q3014945) (← links)
- ALGEBRAIC LINEAR ORDERINGS (Q3086252) (← links)
- Recursion Schemes and the WMSO+U Logic (Q3304152) (← links)
- (Q3336679) (← links)
- (Q3386623) (← links)
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes (Q3617724) (← links)
- Iterated linear control and iterated one-turn pushdowns (Q3776663) (← links)
- (Q4585074) (← links)
