Complete Classifications for the Communication Complexity of Regular Languages

Authors:
Pascal Tesson;Denis Thérien
Affiliations:
-;-
Venue:
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2003

Citing 9
Cited 3

Finite monoids and the fine structure of NC1

Journal of the ACM (JACM)
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Communication complexity

Communication complexity
Varieties Of Formal Languages

Varieties Of Formal Languages
An Algebraic Approach to Communication Complexity

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
An Application of Hindman's Theorem to a Problem on Communication Complexity

Combinatorics, Probability and Computing
On relations between counting communication complexity classes

Journal of Computer and System Sciences
Complexity classes in communication complexity theory

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

Bounded-depth circuits: separating wires from gates

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Groupoids that recognize only regular languages

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Regular languages, unambiguous concatenation and computational complexity

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that every regular language L has either constant, logarithmic or linear two-party communication complexity (in a worst-case partition sense). We prove a similar trichotomy for simultaneous communication complexity and a "quadrichotomy" for probabilistic communication complexity.