scholarly journals On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata

2001 ◽  
Vol 169 (2) ◽  
pp. 284-296 ◽  
Author(s):  
Juraj Hromkovič ◽  
Georg Schnitger
Keyword(s):  
Communication Complexity ◽  
Las Vegas ◽  
Finite Automata

scholarly journals Communication Complexity Method for Measuring Nondeterminism in Finite Automata

2002 ◽  
Vol 172 (2) ◽  
pp. 202-217 ◽  
Author(s):  
Juraj Hromkovič ◽  
Sebastian Seibert ◽  
Juhani Karhumäki ◽  
Hartmut Klauck ◽  
Georg Schnitger
Keyword(s):  
Communication Complexity ◽  
Finite Automata

scholarly journals Generalizations of the distributed Deutsch–Jozsa promise problem

2015 ◽  
Vol 27 (3) ◽  
pp. 311-331 ◽  
Author(s):  
JOZEF GRUSKA ◽  
DAOWEN QIU ◽  
SHENGGEN ZHENG
Keyword(s):  
Communication Complexity ◽  
Quantum Communication ◽  
Hamming Distance ◽  
Finite Automata ◽  
Classical Communication ◽  
Deterministic Finite Automata ◽  
Exact Quantum ◽  
Quantum Communication Complexity

In the distributed Deutsch–Jozsa promise problem, two parties are to determine whether their respective strings x, y ∈ {0,1}n are at the Hamming distanceH(x, y) = 0 or H(x, y) = $\frac{n}{2}$. Buhrman et al. (STOC' 98) proved that the exact quantum communication complexity of this problem is O(log n) while the deterministic communication complexity is Ω(n). This was the first impressive (exponential) gap between quantum and classical communication complexity. In this paper, we generalize the above distributed Deutsch–Jozsa promise problem to determine, for any fixed $\frac{n}{2}$ ⩽ k ⩽ n, whether H(x, y) = 0 or H(x, y) = k, and show that an exponential gap between exact quantum and deterministic communication complexity still holds if k is an even such that $\frac{1}{2}$n ⩽ k < (1 − λ)n, where 0 < λ < $\frac{1}{2}$ is given. We also deal with a promise version of the well-known disjointness problem and show also that for this promise problem there exists an exponential gap between quantum (and also probabilistic) communication complexity and deterministic communication complexity of the promise version of such a disjointness problem. Finally, some applications to quantum, probabilistic and deterministic finite automata of the results obtained are demonstrated.

A NOTE ON REBOUND TURING MACHINES

2004 ◽  
Vol 15 (05) ◽  
pp. 791-807
Author(s):  
KATSUSHI INOUE ◽  
AKIRA ITO ◽  
TAKASHI KAMIURA ◽  
HOLGER PETERSEN ◽  
LAN ZHANG
Keyword(s):  
Las Vegas ◽  
Finite Automata ◽  
Leaf Size ◽  
Turing Machines ◽  
Separation Result ◽  
Computing Models

This paper continues the investigation of rebound Turing machines (RTM's). We first investigate a relationship between the accepting powers of simple one-way 2-head finite automata and simultaneously space-bounded and leaf-size bounded alternating RTM's, and show that for any functions L(n) and Z(n) such that L(n)Z(n)=o( log n) and [Formula: see text], simple one-way 2-head finite automata are incomparable with simultaneously L(n) space-bounded and Z(n) leaf-size bounded alternating RTM's. We then investigate a relationship between Las Vegas and determinism for space-bounded RTM's, and show that there is a language accepted by a Las Vegas rebound automaton, but not accepted by any weakly o( log log n) space-bounded deterministic RTM. This is the first separation result between Las Vegas and determinism for space-bounded computing models over strings.

scholarly journals On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata

2004 ◽  
Vol 68 (3) ◽  
pp. 675-699 ◽  
Author(s):  
Pavol Ďuriš ◽  
Juraj Hromkovič ◽  
Katsushi Inoue
Keyword(s):  
Las Vegas ◽  
Finite Automata ◽  
Two Dimensional

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

2001 ◽  
Vol 262 (1-2) ◽  
pp. 1-24 ◽  
Author(s):  
Juraj Hromkovič ◽  
Georg Schnitger
Keyword(s):  
Las Vegas ◽  
Finite Automata

Physical and Hydrologic-Flow Properties of Fractures Las Vegas, Nevada—Zion Canyon, Utah—Grand Canyon, Arizona—Yucca Mountain, Nevada July 20–24, 1989

10.1029/ft385 ◽  
1989 ◽  
Author(s):  
Christopher C. Barton ◽  
Paul A. Hsieh ◽  
Jacques Angelier ◽  
Francoise Bergerat ◽  
Catherine Bouroz ◽  
...  
Keyword(s):  
Las Vegas ◽  
Grand Canyon ◽  
Yucca Mountain ◽  
Flow Properties
Sign in / Sign up

Export Citation Format

Share Document