On the Power of Las Vegas II: Two-Way Finite Automata - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Juraj Hromkovic. On the Power of Las Vegas II: Two-Way Finite Automata. Electronic Colloquium on Computational Complexity (ECCC), 6(7), 1999. [doi]

The following publications are possibly variants of this publication:

On the Power of Las Vegas II. Two-Way Finite AutomataJuraj Hromkovic, Georg Schnitger. icalp 1999: 433-442 [doi]

On the power of Las Vegas II: Two-way finite automataJuraj Hromkovic, Georg Schnitger. TCS, 262(1):1-24, 2001. [doi]

On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite AutomataJuraj Hromkovic, Georg Schnitger. iandc, 169(2):284-296, 2001.

On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automataPavol Duris, Juraj Hromkovic, Katsushi Inoue. jcss, 68(3):675-699, 2004. [doi]

On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time ComputationsPavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger. eccc, 4(29), 1997. [doi]

Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time ComputationsPavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger. STACS 1997: 117-128

runs on WebDSL