@article{PPO11,
title = "Parallel communicating grammar systems with regular control and skeleton preserving FRR automata",
journal = "Theoretical Computer Science",
volume = "412",
number = "4-5",
pages = "458 - 477",
year = "2011",
issn = "0304-3975",
doi = "DOI: 10.1016/j.tcs.2010.10.017",
url = "http://www.sciencedirect.com/science/article/B6V1G-51B1WTC-1/2/f05d350fcc77b059ea86630f3fe9e084",
author = "Dana Pardubská and Martin Plátek and Friedrich Otto",
keywords = "Parallel communicating grammar system",
keywords = "Regular control",
keywords = "Finite communication complexity",
keywords = "Restarting automaton",
keywords = "Analysis by reduction",
abstract = "Parallel communicating grammar systems with regular control (RPCGS, for short) are introduced, 
which are obtained from returning regular parallel communicating grammar systems by restricting the derivations 
that are executed in parallel by the various components through a regular control language. For the class of 
languages that are generated by RPCGSs with constant communication complexity we derive a characterisation in 
terms of a restricted type of freely rewriting restarting automaton. From this characterisation we obtain that 
these languages are semi-linear, and that for RPCGSs with constant communication complexity, the centralised 
variant has the same generative power as the non-centralised variant."
}