This paper presents new models for all recursive enumerable languages. These models are
based on a multigenerative grammar systems that simultaneously generate several strings …

Multigenerative grammar systems are based on cooperating context-free grammatical
components that simultaneously generate their strings in a rule-controlled or nonterminal …

Besides a derivation step and a communication step, a two-way PC grammar system can
make a reduction step during which it reduces the right-hand side of a context-free …

Parallel Communicating Grammar Systems (PCGS) were introduced as a language-
theoretic treatment of concurrent systems. A PCGS extends the concept of a grammar to a …

Grammar systems is a recent field of formal language theory providing syntactic models and
frameworks for describing and studying (the behaviour of) multi-agent systems at the …

We show how to generate any recursively enumerable language with a nonreturning PC
grammar system having eight context-free components. This is an improvement of …

In the fields of computer science, mathematics, statistics,(bio) physics, or in any other
science that requires mathematical approaches, complexity estimates the computational …

The generative capacity of parallel communicating grammar systems is considered in the
context that the component grammars have distinct terminal and nonterminal sets. In the …

We consider parallel communicating grammar systems which consist of several grammars
and perform derivation steps, where each of the grammars works in a parallel and …

Grammar systems form an important part of investigation of formal aspects of multi-agent
systems. Cooperation, distribution and complexity are basic research topics of grammar …