Pages that link to "Item:Q2907503"
From MaRDI portal
The following pages link to Two-Way Automata Characterizations of L/poly versus NL (Q2907503):
Displaying 4 items.
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- Two-way automata characterizations of L/poly versus NL (Q2354593) (← links)
- State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis (Q5896095) (← links)