Sciweavers

Share
LATA
2009
Springer

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata

12 years 4 months ago
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
Abstract. This paper contributes to the study of Freely Rewriting Restarting 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.
Dana Pardubská, Martin Plátek, Fried
Added 26 Jul 2010
Updated 26 Jul 2010
Type Conference
Year 2009
Where LATA
Authors Dana Pardubská, Martin Plátek, Friedrich Otto
Comments (0)
books