On the computational complexity of context-free Parallel Communicating Grammar Systems
In this paper we investigate the computational complexity for Parallel Communicating Grammar Systems (PCGSs) whose components are context-free grammars. We show that languages generated by nonreturning context-free PCGSs can be recognized by O(n) space-bounded Turing machines. Also we state a sufficient condition for linear space complexity of returning context-free PCGSs. Based on this complexity characterization we also investigate the generative power of context-free PCGSs with respect to context-sensitive PCGSs and context-sensitive grammars.
Unable to display preview. Download preview PDF.
- 1.E. Csuhaj-Varjú, J. Dassow, J. Kelemen, Gh. Păun, Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon and Breach, London, 1994.Google Scholar
- 2.H. R. Lewis, C. H. Papadimitriou, Elements of the Theory of Computation, Prentice-Hall, 1981.Google Scholar
- 3.L. Cai, The Computational Complexity of Linear PCGS, Computer and AI, 15, 2–3 (1996), 199–210Google Scholar
- 4.Gh. Păun, L. Sântean, Parallel Communicating Grammar Systems: The Regular Case, Ann. Univ. Buc., Matem. Inform. Series, 38, 2(1989), 55–63.Google Scholar
- 5.F. L. Ţiplea O. Procopiuc, C. M. Procopiuc, C. Ene, On the Power and Complexity of PCGS, Artificial Life: Grammatical Models (Gh. Păun, ed.), Black Sea University Press, Bucharest, 1995.Google Scholar