On the Degree of Team Cooperation in CD Grammar Systems

Abs t r ac t. 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 re-sults 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 cooper-ating/distributed grammar system cannot be algorithmically computed and discuss a decisión problem.