On the degree of team cooperation in CD grammar systems

Authors:
Fernando Arroyo;Juan Castellanos;Victor Mitrana
Affiliations:
Department of Languages, Projects and Computer Information Systems, University School of Informatics, Polytechnic University of Madrid, Madrid, Spain;Department of Artificial Intelligence, Faculty of Informatics, Polytechnic University of Madrid, Boadilla del Monte, Madrid, Spain;Department of Organization and Structure of Information, University School of Informatics, Polytechnic University of Madrid, Madrid, Spain
Venue:
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Year:
2011

Citing 5
Cited 0

On cooperating/distributed grammar systems

Journal of Information Processing and Cybernetics
Prescribed teams of grammars

Acta Informatica
Teams in grammar systems: hybridity and weak rewriting

Acta Cybernetica - Special issue: selected papers of the workshop grammar systems: recent results and perspectives, Budapest, July 1996
Grammar systems

Handbook of formal languages, vol. 2
Handbook of Formal Languages

Handbook of Formal Languages

Quantified Score

Hi-index	0.00

Visualization

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.