On Competence in CD Grammar Systems

  • Maurice H. ter Beek
  • Erzsébet Csuhaj-Varjú
  • Markus Holzer
  • György Vaszil
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3340)


We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying sentential form. A component is said to be = k-competent (≤ k-, ≥ k-competent, resp.) on a sentential form if it is able to rewrite exactly k (at most k, at least k, resp.) different nonterminals appearing in that string. In most cases CDGSs working according to the above described cooperation strategy turn out to give new characterizations of the language families based on random context conditions, namely random context (context-free) languages and the biologically motivated family of languages generated by ET0L systems with random context. Thus, the results presented in this paper can shed new light on some longstanding open problems in the theory of regulated rewriting.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bordihn, H., Csuhaj-Varjú, E.: On competence and completeness in CD grammar systems. Acta Cybernetica 12(4), 347–361 (1996)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Bordihn, H., Holzer, M.: Grammar systems with negated conditions in their cooperation protocols. In: JUCS, vol. 6, pp. 1165–1184 (2000)Google Scholar
  3. 3.
    Csuhaj-Varj´u, E., Dassow, J.: On cooperating distributed grammar systems. In: EIK, vol. 26, pp. 49–63 (1990)Google Scholar
  4. 4.
    Csuhaj-Varjú, E., Dassow, J., Holzer, M.: On a Competence-based Cooperation Strategy in CD Grammar Systems. Technical Report 2004/3, Theoretical Computer Science Research Group, Computer and Automation Research Institute, Hungarian Academy of Sciences (2004)Google Scholar
  5. 5.
    Csuhaj-Varjú, E., Dassow, J., Holzer, M.: CD Grammar Systems with Competence Based Entry Conditions in Their Cooperation Protocols. Technical Report 2004/4, Theoretical Computer Science Research Group, Computer and Automation Research Institute, Hungarian Academy of Sciences (2004)Google Scholar
  6. 6.
    Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, Gh.: Grammar Systems— A Grammatical Approach to Distribution and Cooperation. Gordon and Breach (1994)Google Scholar
  7. 7.
    Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. In: EATCS Monographs on Theoretical Computer Science, vol. 18, Springer-Verlag, Berlin (1989)Google Scholar
  8. 8.
    Fernau, H., Wätjen, D.: Remarks on regulated limited ET0L systems and regulated context-free grammars. In: TCS, vol. 194, pp. 35–55 (1998)Google Scholar
  9. 9.
    Meersman, R., Rozenberg, G.: Cooperating grammar systems. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, Springer, Heidelberg (1978)Google Scholar
  10. 10.
    Păun, Gh., Rozenberg, G.: Prescribed teams of grammars. Acta Informatica 31, 525–537 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    von Solms, S.H.: Some notes on ET0L-languages. In: IJCM, vol. 5, pp. 285–296 (1976)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Maurice H. ter Beek
    • 1
  • Erzsébet Csuhaj-Varjú
    • 2
  • Markus Holzer
    • 3
  • György Vaszil
    • 2
  1. 1.Istituto di Scienza e Tecnologie dell’InformazionePisaItaly
  2. 2.Computer and Automation Research InstituteHungarian Academy of SciencesBudapestHungary
  3. 3.Institut für InformatikTechnische Universität MünchenMünchenGermany

Personalised recommendations