The following pages link to (Q4061986):
Displaying 15 items.
- Look-ahead on pushdowns (Q579952) (← links)
- Parameter-reduction of higher level grammars (Q1099634) (← links)
- The OI-hierarchy is closed under control (Q1109578) (← links)
- The IO- and OI-hierarchies (Q1161273) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- IO and OI. I (Q1241985) (← links)
- IO and OI. II (Q1243578) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- Principal abstract families of weighted tree languages (Q2064529) (← links)
- Local higher-order fixpoint iteration (Q2105477) (← links)
- Weighted automata with storage (Q2280328) (← links)
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable (Q2422040) (← links)
- (Q3386623) (← links)
- (Q5021005) (← links)
- Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered (Q5090949) (← links)
