Parallel communicating grammar systems with regular control and skeleton preserving FRR automata

Authors:
Dana Pardubská;Martin Plátek;Friedrich Otto
Affiliations:
Department of Computer Science, Comenius University, Mlynská dolina, 84248 Bratislava, Slovak Republic;Faculty of Mathematics and Physics, Department of Computer Science, Charles University, Malostranské nám. 25, 118 00 Praha 1, Czech Republic;Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109 Kassel, Germany
Venue:
Theoretical Computer Science
Year:
2011

Citing 7
Cited 0

Cooperating/distributed grammar systems with hypothesis languages

Journal of Experimental & Theoretical Artificial Intelligence
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Two Lower Bounds on Distributive Generation of Languages

MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata

Language and Automata Theory and Applications
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Parallel Communicating Grammar Systems with Regular Control

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics

Quantified Score

Hi-index	5.23

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 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.