Pages that link to "Item:Q3637213"
From MaRDI portal
The following pages link to Size Complexity of Two-Way Finite Automata (Q3637213):
Displaying 16 items.
- Size complexity of rotating and sweeping automata (Q414916) (← links)
- An alternating hierarchy for finite automata (Q442279) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- New size hierarchies for two way automata (Q1992112) (← links)
- Alternation in two-way finite automata (Q2029487) (← links)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- Two-way automata characterizations of L/poly versus NL (Q2354593) (← links)
- From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods (Q2947420) (← links)
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (Q3451094) (← 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)
- Complement for two-way alternating automata (Q5919102) (← 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)
