Skip to main content
SpringerLink
Log in

On the Separation between k-Party and (k - 1)-Party Nondeterministic Message Complexities

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2002)

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

Included in the following conference series:

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.

Supported by the Deutscher Akademischer Austauschdienst (DAAD) and DFG Project HR 14/16-1

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. H. Abelson, Lower Bounds on Information Transfer in Distributed Computation. Proc. 19th IEEE FOCS (1978), 151–158.

    Google Scholar 

  2. H.N. Adorna, Some Properties of k-Party Message Complexity. Unpublished Manuscript, RWTH-Aachen (2001).

    Google Scholar 

  3. H.N. Adorna, 3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automaton. In: J. Dassow, D. Wotschke (eds.) Pre-Proc. 3rd Internatonal Workshop on Descriptional Complexity of Automata, Grammars and Related Structures Preprint No. 16, Uni. Magdeburg. (2001), 23–34.

    Google Scholar 

  4. J.E. Hopcroft, J.D. Ullman, Introduction Automata Theory, Languages and Computation. Addison-Wesley, 1979.

    Google Scholar 

  5. J. Hromkovič, Relation Between Chomsky Hierarchy and Communication Complexity Hierarchy Acta Math. Univ. Com., Vol 48–49 (1986), 311–317.

    Google Scholar 

  6. J. Hromkovič, Communication Complexity and Parallel Computating. Springer, 1997.

    Google Scholar 

  7. J. Hromkovič, G. Schnitger, Communication Complexity and Sequential Computation. In: Prĺara, P. Ružička (eds.) Proc. of Mathematical Foundation of Computer Science, LNCS 1295, Springer-Verlag (1997) 71–84.

    Google Scholar 

  8. J. Hromkovič, G. Schnitger, On the Power of Las Vegas for One-Way Communication Complexity, OBDD’s and Finite Automata. Information and Computation, 169 (2001), 284–296.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. Hromkovič, S. Seibert, J, Karhumäki, H. Klauck, G. Schnitger, Communication Complexity Method for Measuring Nondeterminism in Finite Autmata. Information and Computation 172 (2002), 202–217.

    Article  MathSciNet  MATH  Google Scholar 

  10. G. Jirăaskova, Finite Automata and Communication Protocols. In: C. Martin-vide, V. Mitrana (eds.) Words, Sequences, Grammars, Languages: Where Biology, Computer Science, Linguistics and Mathematics Meet II, to appear.

    Google Scholar 

  11. H. Klauck, G. Schnitger, Nondeterministic Finite Automata versus Nondeterministic Uniform Communication Complexity. Unpublished Manuscript, University of Frankfurt, (1996).

    Google Scholar 

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

    Google Scholar 

  13. F. Moore, On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic and Two-Way Finite Automata. IEEE Trans. Comput. 20 (1971), 1211–1214.

    Article  MATH  Google Scholar 

  14. C. Papadimitriou, M. Sipser, Communication Complexity. Proc. 14th ACM STOC, (1982), 196–200.

    Google Scholar 

  15. P. TiwariLower Bound on Communication Complexity in Distributed Computer Networks. Journal of the ACM, Vol.42, No. 4 (1987) 921–938.

    Google Scholar 

  16. A.C. YaoSome Complexity Questions Related to Distributed Computing. Proc. 11th ACM STOC, (1979), 209–213.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Informatik I, RWTH-Aachen, Ahornstraβe 55, D-52074, Aachen, Germany

    Henry N. Adorna

  2. Department of Mathematics, Univ. of the Philippines, Diliman 1101, Q.C., Philippines

    Henry N. Adorna

Authors
  1. Henry N. Adorna
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Faculty of Engineering, Kyoto Sangyo University, 603-8555, Kyoto, Japan

    Masami Ito  & Masafumi Toyama  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Adorna, H.N. (2003). On the Separation between k-Party and (k - 1)-Party Nondeterministic Message Complexities. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45005-X_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40431-6

  • Online ISBN: 978-3-540-45005-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation