Skip to main content
SpringerLink
Log in

Complete Classifications for the Communication Complexity of Regular Languages

  • Conference paper
  • First Online:
Book cover STACS 2003 (STACS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2607))

Included in the following conference series:

Abstract

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

Research supported in part by NSERC and FCAR grants.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In Proc. 27th IEEE FOCS, pages 337–347, 1986.

    Google Scholar 

  2. D. A. Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci., 38(1):150–164, Feb. 1989.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. A. M. Barrington and D. Thérien. Finite monoids and the fine structure of NC1. Journal of the ACM, 35(4):941–952, Oct. 1988.

    Article  Google Scholar 

  4. C. Damm,, M. K. C. Meinel, and S. Waack. On relations between counting communication complexity classes. To appear in Journal of Computer and Systems Sciences. Currently available e.g. from http://www.num.math.uni-goettingen.de/damm/ and preliminary version in proceedings of STACS’92.

  5. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.

    Google Scholar 

  6. J.-E. Pin. Varieties of formal languages. North Oxford Academic Publishers Ltd, London, 1986.

    Google Scholar 

  7. P. Pudlák. An application of Hindman’s theorem to a problem on communication complexity. Draft, 2002.

    Google Scholar 

  8. J.-F. Raymond, P. Tesson, and D. Thérien. An algebraic approach to communication complexity. Lecture Notes in Computer Science (ICALP’98), 1443:29–40, 1998.

    Google Scholar 

  9. M. Szegedy. Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC. J. Comput. Syst. Sci., 47(3):405–423, 1993.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University, USA

    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

Editor information

Editors and Affiliations

  1. Institut für Informatik, Freie Universität Berlin, Takusstr. 9, 14195, Berlin, Germany

    Helmut Alt

  2. LIRMM, 161, Rue Ada, 34392, Montpellier Cedex 5, France

    Michel Habib

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tesson, P., Thérien, D. (2003). Complete Classifications for the Communication Complexity of Regular Languages. In: Alt, H., Habib, M. (eds) STACS 2003. STACS 2003. Lecture Notes in Computer Science, vol 2607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36494-3_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-36494-3_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00623-7

  • Online ISBN: 978-3-540-36494-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation