The following pages link to (Q4139689):
Displaying 26 items.
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Finite automata and unary languages (Q1099644) (← links)
- Lower bounds on the size of sweeping automata (Q1145513) (← links)
- Converting two-way nondeterministic unary automata into simpler automata. (Q1401239) (← links)
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs (Q1566750) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← 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)
- Complementing two-way finite automata (Q2643079) (← links)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- Two-Way Automata versus Logarithmic Space (Q3007639) (← links)
- Nondeterminism Is Essential in Small 2FAs with Few Reversals (Q3012920) (← links)
- Deterministic blow-ups of minimal NFA's (Q3421910) (← links)
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (Q3451094) (← links)
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages (Q3533030) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Size Complexity of Two-Way Finite Automata (Q3637213) (← links)
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (Q4640037) (← 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)
- Power of counting by nonuniform families of polynomial-size finite automata (Q6546609) (← links)
- Unambiguous and co-nondeterministic computations of finite automata and pushdown automata families and the effects of multiple counters (Q6636064) (← links)
