On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata

Authors:
Dana Pardubská;Martin Plátek;Friedrich Otto
Affiliations:
Dept. of Computer Science, Comenius University, Bratislava,;Dept. of Computer Science, Charles University, Prague,;Fachbereich Elektrotechnik/Informatik, Universität Kassel, Kassel,
Venue:
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Year:
2009

Citing 2
Cited 3

Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
On determinism versus nondeterminism for restarting automata

Information and Computation

Segmentation Charts for Czech --- Relations among Segments in Complex Sentences

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
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper contributes to the study of Freely Rewriting Re-starting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the linguistic method of analysis by reduction . For PCGS we study two complexity measures called generation complexity and distribution complexity , and we prove that a PCGS *** , for which both these complexity measures are bounded by constants, can be simulated by a freely rewriting restarting automaton of a very restricted form. From this characterization it follows that the language L (*** ) is semi-linear, that its characteristic analysis is of polynomial size, and that this analysis can be computed in polynomial time.