Pages that link to "Item:Q5428242"
From MaRDI portal
The following pages link to Descriptional Complexity of Bounded Context-Free Languages (Q5428242):
Displaying 4 items.
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- On bounded languages and reversal-bounded automata (Q899318) (← links)
- Parikh’s Theorem and Descriptional Complexity (Q2891382) (← links)
- Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096) (← links)
