On the power of Las Vegas II: Two-way finite automata

Theoretical Computer Science

Volumn 262, Issue 1-2, 2001, Pages 1-24

  Hromkovič, Juraj ^a   Schnitger, Georg ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; RANDOM PROCESSES;

TWO WAY FINITE AUTOMATA;

FINITE AUTOMATA;

EID: 0034911860     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00155-9     Document Type: Article

References (20)

1. On notions of information transfer in VLSI circuits
2. A note on sweeping automata
3. Exact lower bounds for computing Boolean functions on CREW PRAMs
4. Las Vegas versus determinism for one-way communication complexity, finite automata and polynomial-time computations
5. Computational complexity of probabilistic Turing machines
6. Las Vegas is better than determinism in VLSI and distributed computing
7. Two-way deterministic finite automata are exponentially more succinct than sweeping automata
8. Communication complexity
9. On nondeterminism versus randomness for read-once branching programs
10. On the size of randomized OBDDs and read-once branching programs for k-stable functions
11. Nondeterminism and the size of two way finite automata
12. Lower bounds on the size of sweeping automata
13. Lower bounds on the size of sweeping automata
14. The Complexity of Boolean Functions
15. Some complexity questions related to distributed computing