In classic formal language and automata theory, grammars and automata were modeling
classic computing devices. Such devices were “centralized”—the computation was …

It is shown that non-returning parallel communicating grammar systems with λ-free context-
free components can generate any recursively enumerable language. Since it was proven …

We prove that all recursively enumerable languages can be generated by context-free
returning parallel communicating grammar systems by showing how the parallel …

Non-returning PC grammar systems with n context free components are simulated in [3] by
returning PC grammar systems with 4n2− 3n+ 1 components. In this paper we reduce the …

First, we recall several recent results concerning the generative power of parallel
communicating (PC) grammar systems, including characterizations of recursively …

Parallel communicating grammar systems (PCGS for short) were introduced as a
grammatical model of parallel computations. Communication plays a major role in parallel …

Coverability trees offer a finite characterization of all the derivations of a context-free parallel
grammar system (CF-PCGS). Their finite nature implies that they necessarily omit some …

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 compare the power of two (fairly different) recently investigated language identifying
devices: patterns and parallel communicating (PC) grammar systems. The simulation of …

In this paper, we consider parallel communicating systems where the components of the
systems are given by k-limited and uniformly k-limited 0L systems (or by such ET0L systems …