Pages that link to "Item:Q1157965"
From MaRDI portal
The following pages link to Two-way deterministic finite automata are exponentially more succinct than sweeping automata (Q1157965):
Displaying 14 items.
- Size complexity of rotating and sweeping automata (Q414916) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Two-way deterministic finite automata are exponentially more succinct than sweeping automata (Q1157965) (← links)
- Converting two-way nondeterministic unary automata into simpler automata. (Q1401239) (← links)
- Tight lower bounds on the size of sweeping automata (Q1604196) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (Q3451094) (← links)
- On the Size Complexity of Rotating and Sweeping Automata (Q3533032) (← links)
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (Q4640037) (← links)
- DETERMINISM VS. NONDETERMINISM FOR TWO-WAY AUTOMATA: Representing the Meaning of States by Logical Formulæ (Q5495414) (← links)
- On the power of Las Vegas II: Two-way finite automata (Q5958109) (← links)
