An Application of Dynamic P Systems: Generating Context-Free Languages

We present a method of generating context-free languages, in a parallel way, using dynamic P systems, which evolve in time in a coherent manner. The evolution is described by a contextual grammar D(G), which can be canonically associated to any context-free grammar G. The dynamic P system generated by D(G) will "compute" the language L(G), i.e., one of the configurations of the system will contain all words of L(G) of length n at depth 2n - 1. Our approach is an attempt to prove the richness and power of the concept of dynamic P system, both in the area of P systems, and in the area of contextual grammars.

[1]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[2]  Rodica Ceterchi,et al.  Dynamic P Systems , 2002, WMC-CdeA.

[3]  Solomon Marcus,et al.  Contextual Grammars , 1969, COLING.

[4]  Gheorghe Paun,et al.  On P Systems with Membrane Creation , 2001, Comput. Sci. J. Moldova.

[5]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[6]  Alfonso Rodríguez-Patón,et al.  Computing with membranes: P systems with worm-objects , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.

[7]  Carlos Martín-Vide,et al.  Computing with Membranes: Variants with an Enhanced Membrane Handling , 2001, DNA.

[8]  Raghavan Rama,et al.  P Systems with Replicated Rewriting , 2001, J. Autom. Lang. Comb..

[9]  Gheorghe Paun.  P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..

[10]  Gheorghe Paun,et al.  Marcus Contextual Grammars , 1994, Bull. EATCS.

[11]  Carlos Martín-Vide,et al.  Structured Contextual Grammars , 1998, Grammars.

[12]  Gheorghe Paun,et al.  Computing with Membranes: An Introduction , 1999, Bull. EATCS.

[13]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.