On the separation between k-party and (k - 1)-party nondeterministic message complexities

Authors:
Henry N. Adorna
Affiliations:
Lehrstuhl für Informatik I, RWTH-Aachen, Aachen, Germany and Department of Mathematics, Univ. of the Philippines, Diliman, Q.C., Philippines
Venue:
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Year:
2002

Citing 12
Cited 2

Lower bounds on communication complexity in distributed computer networks

Journal of the ACM (JACM)
Communication complexity hierarchy

Theoretical Computer Science
Communication complexity and parallel computing

Communication complexity and parallel computing
Communication complexity

Communication complexity
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata

Information and Computation
Communication complexity method for measuring nondeterminism in finite automata

Information and Computation
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Communication Complexity and Sequential Compuation

MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Communication complexity

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

IEEE Transactions on Computers
Lower bounds on information transfer in distributed computations

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science

On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce (reasonable) generalizations of the one-way uniform two-party protocols introduced in [6,7], which provide a closer relationship between communication complexity and finite automata as regular language recognizers. A superpolynomial separation between k- party and (k - 1)-party message complexities of the nondeterministic model is established by exhibiting a sequence of concrete languages to witness it, thus a strong hierarchy result. As a consequence, the new model provides an essentially better lower bound method for estimating ns(L), for some regular languages L. We remark that in the deterministic case hierarchy is not realized.