Rewriting P Systems with Conditional Communication: Improved Hierarchies
H. Ramesh ; Raghavan Rama
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
We consider here a variant of rewriting P systems [1], where communication is controlled by the contents of the strings, not by the evolution rules used for obtaining these strings. Some new characterizations of recursively enumerable languages are obtained by means of P systems with a small number of membranes, which improves some of the known results from [1] and [4].
Publié le : 2012-01-26
Classification:  Membrane computing; rewriting P systems; recursively enumerable language 
@article{cai243,
     author = {H. Ramesh and Raghavan Rama},
     title = {Rewriting P Systems with Conditional Communication: Improved Hierarchies},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai243}
}

H. Ramesh; Raghavan Rama. Rewriting P Systems with Conditional Communication: Improved Hierarchies. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai243/