Pages that link to "Item:Q2354593"
From MaRDI portal
The following pages link to Two-way automata characterizations of L/poly versus NL (Q2354593):
Displaying 6 items.
- Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419) (← links)
- Homomorphisms on graph-walking automata (Q2164747) (← 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)
- On the transformation of two-way finite automata to unambiguous finite automata (Q6186312) (← links)
