Pages that link to "Item:Q3319777"
From MaRDI portal
The following pages link to The recognition of deterministic CFLs in small time and space (Q3319777):
Displaying 6 items.
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Fast recognition of deterministic cfl's with a smaller number of processors (Q685360) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- Certifying DFA bounds for recognition and separation (Q2147179) (← links)
- Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automata (Q2695283) (← links)