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 characterization in terms of a restricted type of freely rewriting restarting automaton. From this characterization we obtain that these languages are semi-linear, and that centralized RPCGSs with constant communication complexity are of the same generative power as non-centralized RPCGSs with constant communication complexity. © 2009 Springer.
Author supplied keywords
Cite
CITATION STYLE
Pardubská, D., Plátek, M., & Otto, F. (2009). Parallel communicating grammar systems with regular control. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5725 LNCS, pp. 342–360). https://doi.org/10.1007/978-3-642-03564-7_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
