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.Downloads
Download data is not yet available.
Published
2012-03-05
How to Cite
Mihalache, V. (2012). On the Generative Capacity of PCGDCs with Regular Components. Computing and Informatics, 15(2-3), 155–172. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/698
Issue
Section
Articles