Descripción
|
|
---|---|
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. | |
Internacional
|
Si |
Nombre congreso
|
Descriptional Complexity of Formal Systems |
Tipo de participación
|
960 |
Lugar del congreso
|
Limburg, Alemania |
Revisores
|
Si |
ISBN o ISSN
|
978-3-642-22599-4 |
DOI
|
10.1007/978-3-642-22600-7_6 |
Fecha inicio congreso
|
27/06/2011 |
Fecha fin congreso
|
02/07/2011 |
Desde la página
|
68 |
Hasta la página
|
79 |
Título de las actas
|
Lecture Notes in Computer Science Volume 680 |