On the Degree of Team Cooperation in CD Grammar Systems

  • Fernando Arroyo
  • Juan Castellanos
  • Victor Mitrana
Conference paper

DOI: 10.1007/978-3-642-22600-7_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)
Cite this paper as:
Arroyo F., Castellanos J., Mitrana V. (2011) On the Degree of Team Cooperation in CD Grammar Systems. In: Holzer M., Kutrib M., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg

Abstract

In this paper, we introduce a dynamical complexity measure, namely the degree of team cooperation, in the aim of investigating “how much” the components of a grammar system cooperate when forming a team in the process of generating terminal words. We present several results which strongly suggest that this measure is trivial in the sense that the degree of team cooperation of any language is bounded by a constant. Finally, we prove that the degree of team cooperation of a given cooperating/distributed grammar system cannot be algorithmically computed and discuss a decision problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Fernando Arroyo
    • 1
  • Juan Castellanos
    • 2
  • Victor Mitrana
    • 3
  1. 1.Department of Languages, Projects and Computer Information SystemsUniversity School of Informatics Polytechnic University of MadridMadridSpain
  2. 2.Department of Artificial Intelligence, Faculty of InformaticsPolytechnic University of MadridMadridSpain
  3. 3.Department of Organization and Structure of InformationUniversity School of Informatics Polytechnic University of MadridMadridSpain

Personalised recommendations