论文信息 - Evolution-Communication P Systems

Evolution-Communication P Systems

We propose a new class of P systems that use simple evolution rules (classical evolution rules without communication targets) and symport/antiport rules (for communication).

Matteo Cavaliere

[1] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .

[2] Vincenzo Manca,et al. P Systems with Boundary Rules , 2002, WMC-CdeA.

[3] Andrei Paun,et al. On the Power of P Systems with Symport Rules , 2002, J. Univers. Comput. Sci..

[4] Petr Sosík,et al. Membrane Computing: When Communication Is Enough , 2002, UMC.

[5] B. Alberts,et al. An Introduction to the Molecular Biology of the Cell , 1998 .

[6] Henning Fernau,et al. How Powerful is Unconditional Transfer? - When UT meets AC , 1997, Developments in Language Theory.

[7] Andrei Paun,et al. Computing by Communication in Networks of Membranes , 2002, Int. J. Found. Comput. Sci..

[8] Andrei Paun,et al. Further Remarks on P Systems with Symport Rules , 2001, Sci. Ann. Cuza Univ..

[9] Andrei Paun,et al. ReMembrane Systems with Coupled Transport: Universality and Normal Forms , 2002, Fundam. Informaticae.

[10] Hendrik Jan Hoogeboom,et al. Simulating Counter Automata by P Systems with Symport/Antiport , 2002, WMC-CdeA.

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