On the Generative Capacity of PCGDCs with Regular Components

Abstract

The paper considers  the simplest class of parallel communicating grammar systems (PCGSs), namely with regular components, which yet seems to be not enough investigated. It is proved that in the centralized returning case (deriving in the usual mode) and in the non-centralized non-returning case with terminal derivation the systems are not "too powerful", more exactly they can be simulated by finite index matrix grammars.