Pages that link to "Item:Q1198017"
From MaRDI portal
The following pages link to A lower bound for the nondeterministic space complexity of context-free recognition (Q1198017):
Displaying 8 items.
- Limits of Baumslag-Solitar groups and dimension estimates in the space of marked groups. (Q454402) (← links)
- Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- Quantum computation with write-only memory (Q1761714) (← links)
- Certifying DFA bounds for recognition and separation (Q2147179) (← links)
- Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
- A combinatorial characterization of smooth LTCs and applications (Q2820271) (← links)
- TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES (Q5168415) (← links)
