The following pages link to (Q4228510):
Displayed 5 items.
- Size complexity of rotating and sweeping automata (Q414916) (← links)
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (Q1854456) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations (Q5047164) (← links)