On the power of las vegas ii. Two-way finite automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 433-442

  Hromkovič, Juraj ^a   Schnitger, Georg ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; FORMAL LANGUAGES;

COMPUTATIONAL POWER; DETERMINISTIC FINITE AUTOMATA; LAS VEGAS; NON-DETERMINISM; TWO WAYS; TWO-WAY FINITE AUTOMATA;

C (PROGRAMMING LANGUAGE);

EID: 84887431039     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_40     Document Type: Conference Paper

References (20)

1. [AHY83] Aho, A.V., Hopcroft, J.E., Yannakakis, M.: On notions of information transfer in VLSI circuits. In: Proc. 15th Annual ACM STOCS, ACM 1983, pp. 133-139.
2. [Ba79] Babai, L.: Monte Carlo algorithms in graph isomorphism techniques. Research Report no. 79-10, Departement de mathematiques et statistique, Universite de Montreal 1979.
3. [Be80] Berman, P.: A note on sweeping automata. In Proc. of 7th ICALP 80 (J.W. de Bakker and Jan van Leeuwen, editors), Lecture Notes in Computer Science 85, 1980, pp. 91-97.
4. [DHRS97] Duris, P., Hromkovic, J., Rolim, J.D.P., Schnitger, G.: Las Vegas versus determinism for one-way communication complexity, finite automata and polynomial-time computations. In: Proc. STACS 97, Lecture Notes in Computer Science 1200, Springer 1997, pp. 117-128 (extended version submitted to Information and Computation).
5. [DKR94] Dietzelfelbinger, M., Kutylowski, M., Reischuk, R.: Exact lower bounds for computing Boolean functions on CREW PRAMs. J. Computer System Sciences 48 (1994), pp. 231-254.
6. [Gi77] Gill, J.: Computational complexity of probabilistic Turing machines. SIAM J. Comput. 6 (1977), pp. 675-695.
7. [Hr97] Hromkovic, J.: Communication Complexity and Parallel Computing. Springer-Verlag 1997.
8. [HU79] Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computations. Addison-Wesley, 1979.
9. [KN97] Kushilevitz, E., Nisan, N.: Communication Complexity, Cambridge University Press 1997.
10. [Mi81] Micali, S.: Two-way deterministic finite automata are exponentially more succinct than sweeping automata. Information Processing Letters, 12(2), 1981, pp. 103-105.
11. [MS82] Mehlhorn, K., Schmidt, E.: Las Vegas is better than determinism in VLSI and distributed computing. In: Proc. 14th ACM STOC82, ACM 1982, pp. 330-337.
12. [MS97] Macarie, I.I., Seiferas, J.I.: Strong equivalence of nondeterministic and randomized space-bounded computations. Manuscript.
13. [PS84] Papadimitrou, C., Sipser, M.: Communication complexity. J. Computer System Sciences 28, pp. 260-269.
14. [Sa97] Sauerho, M.: On nondeterminism versus randomness for read-once branching programs. Electronic Colloquium on Computational Complexity, TR 97 - 030.
15. [Sa99] Sauerho, M.: On the size of randomized OBDDs and read-once branching programs for k-stable functions. In: Proc. STACS 99, Lecture Notes in Computer Science, 1563, Springer 1999, pp. 488-499.
16. [Si79] Sipser, M.: Lower bounds on the size of sweeping automata. In: Proc. 11th ACM STOC, 1979, pp. 360-364.
17. [Si80] Sipser, M.: Lower bounds on the size of sweeping automata. J. of Computer and System Sciences 21 (1980), pp. 195-202.
18. [SS78] Sakoda, W. J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: Proc. of 10th ACM STOC, ACM 1978, pp. 275-286.
19. [We87] Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner Series in Computer Science, John Wiley and Sons Ltd., and Teubner, B.G., Stuttgart 1987.
20. [Ya79] Yao, A.C.: Some complexity questions related to distributed computing. In: Proc. 11th ACM STOC, ACM 1979, pp. 209-213.