Pages that link to "Item:Q549665"
From MaRDI portal
The following pages link to Two-way unary automata versus logarithmic space (Q549665):
Displaying 9 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 versus logarithmic space (Q2254505) (← links)
- Two-way automata characterizations of L/poly versus NL (Q2354593) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- DETERMINISM VS. NONDETERMINISM FOR TWO-WAY AUTOMATA: Representing the Meaning of States by Logical Formulæ (Q5495414) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis (Q5896095) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
