PC grammar systems with clusters of components

Erzsébet Csuhaj-Varjú, Marion Oswald, György Vaszil

Research output: Contribution to journalArticle

1 Citation (Scopus)


We introduce PC grammar systems where the components form clusters and the query symbols refer to clusters not individual grammars, i.e., the addressee of the query is not precisely identified. We prove that if the same component replies to all queries issued to a cluster in a rewriting step, then non-returning PC grammar systems with 3 clusters and 7 context-free components are able to generate any recursively enumerable language. We also provide open problems and directions for future research.

Original languageEnglish
Pages (from-to)203-212
Number of pages10
JournalInternational Journal of Foundations of Computer Science
Issue number1
Publication statusPublished - Jan 1 2011


  • Clusters of agents
  • Descriptional complexity
  • Distributed problem solving
  • Parallel communicating grammar systems

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this