Skip to main content
SpringerLink
Log in

Complete Classifications for the Communication Complexity of Regular Languages

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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 similar classifications for the communication complexity of regular languages for the simultaneous, probabilistic, simultaneous probabilistic and Modp-counting models of communication.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University, 3480 rue University, Montréal, Québec, H3A 2A7, Canada

    Pascal Tesson & Denis Thérien

Authors
  1. Pascal Tesson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Denis Thérien
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Pascal Tesson or Denis Thérien.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tesson, P., Thérien, D. Complete Classifications for the Communication Complexity of Regular Languages. Theory Comput Syst 38, 135–159 (2005). https://doi.org/10.1007/s00224-004-1190-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-004-1190-2

Keywords

Search

Navigation