Parallel Communicating Grammar Systems with Regular Control

  • Authors:
  • Dana Pardubská;Martin Plátek;Friedrich Otto

  • Affiliations:
  • Department of Computer Science, Comenius University, Bratislava, Slovak Republic;Department of Computer Science, Charles University, Prague, Czech Republic;Fachbereich Elektrotechnik/Informatik, Universität Kassel, Kassel, Germany

  • Venue:
  • CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.