On the Degree of Team Cooperation in CD Grammar Systems
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.
Unable to display preview. Download preview PDF.
- 4.Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems. Gordon and Breach (1994)Google Scholar
- 6.Dassow, J., Păun, G., Rozenberg, G.: Grammar Systems. In: Google Scholar
- 9.Mateescu, A., Mitrana, V., Salomaa, A.: Dynamical teams in cooperating distributed grammar systems. Ann. Univ. of Bucharest, 3–14 (1993-1994)Google Scholar
- 10.Nii, P.H.: Blackboard systems. In: Barr, A., Cohen, P.R., Feigenbaum, E.A. (eds.) The Handbook of AI, vol. 4. Addison-Wesley, London (1989)Google Scholar