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. © Springer-Verlag Berlin Heidelberg 2003.
An application of dynamic P systems: Generating context-free languages / Enguix, G. B.; Cavaliere, M.; Ceterchi, R.; Gramatovici, R.; Martin-Vide, C.. - 2597:(2003), pp. 90-106. (Intervento presentato al convegno Workshop on Membrane Computing tenutosi a Romania nel 2002).
An application of dynamic P systems: Generating context-free languages
Cavaliere M.;
2003
Abstract
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. © Springer-Verlag Berlin Heidelberg 2003.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
