A Note on P Systems with Activators (bibtex)

by Alhazov, Artiom

Abstract:

The usual assumption in P systems behavior is that of maximal parallelism, however in living cells it is not the case because they have a limited number of enzymes. The aim of this paper is to try to merge these ideas by introducing a notion of activator - a formal model of enzyme as a usual symbol-object, more or less a middle notion between a catalyst and a promoter. Each activator executes one (context-free) rule, and can evolve in the same step. The rules will need activators to be applied, so the parallelism of each rule is maximal, but limited to the number of its activators. Such systems can generate any recursively enumerable language or deterministically accept any recursively enumerable set of vectors of nonnegative integers. It is open what is the power of P systems with uniport rules and activators.

Reference:

A Note on P Systems with Activators (Alhazov, Artiom), In Second Brainstorming Week on Membrane Computing (Gh. Paun, A. Riscos-Nunez, A. Romero-Jimenez, F. Sancho-Caparrini, ed.), University of Seville, volume 01/2004, 2004.

Bibtex Entry:

@InProceedings{inp120, author = {Alhazov, Artiom}, title = {A Note on P Systems with Activators}, booktitle = {Second Brainstorming Week on Membrane Computing}, year = {2004}, editor = {Gh. Paun, A. Riscos-Nunez, A. Romero-Jimenez, F. Sancho-Caparrini}, volume = {01/2004}, series = {Technical Report}, pages = {16--19}, publisher = {University of Seville}, abstract = {The usual assumption in P systems behavior is that of maximal parallelism, however in living cells it is not the case because they have a limited number of enzymes. The aim of this paper is to try to merge these ideas by introducing a notion of activator - a formal model of enzyme as a usual symbol-object, more or less a middle notion between a catalyst and a promoter. Each activator executes one (context-free) rule, and can evolve in the same step. The rules will need activators to be applied, so the parallelism of each rule is maximal, but limited to the number of its activators. Such systems can generate any recursively enumerable language or deterministically accept any recursively enumerable set of vectors of nonnegative integers. It is open what is the power of P systems with uniport rules and activators.}, file = {A2004c.pdf:pdfs/A2004c.pdf:PDF}, keywords = {Parallelism, Enzyme, Promoter, Catalyst, Activator, Rewriting, Uniport}, }

Powered by bibtexbrowser