Pages that link to "Item:Q3517107"
From MaRDI portal
The following pages link to On recursive and non-recursive trade-offs between finite-turn pushdown automata (Q3517107):
Displaying 8 items.
- Descriptional complexity of bounded context-free languages (Q383365) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Non-recursive trade-offs between two-dimensional automata and grammars (Q896688) (← links)
- Deterministic finite automata with recursive calls and DPDAs (Q1014418) (← links)
- Non-recursive trade-offs are ``almost everywhere'' (Q2179345) (← links)
- On The Space Complexity Of Turn Bounded Pushdown Automata (Q4709850) (← links)
- Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096) (← links)
- Non-recursive Trade-offs between Two-Dimensional Automata and Grammars (Q5496202) (← links)