Unexpected universality results for three classes of P systems with symport/antiport

  • Authors:
  • Mihai Ionescu;Carlos Martí/n-Vide;Andrei Pă/un;Gheorghe Pă/un

  • Affiliations:
  • Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109 Bucharest, Romania (E-mail: ionescu.mihai@email.ro);Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tá/rraco 1, 43005 Tarragona, Spain (E-mail: cmv@astor.urv.es);Department of Computer Science, University of Western Ontario, London, Ontario, Canada N6A 5B7 (E-mail: apaun@csd.uwo.ca);Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tá/rraco 1, 43005 Tarragona, Spain/ Research Group on Mathematical Linguistics, Institute of Mathematics o ...

  • Venue:
  • Natural Computing: an international journal
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Symport and antiport are biological ways of transporting molecules through membranesin ``collaborating'' pairs; in the case of symport the two molecules pass in the same direction, in the case of antiport the two molecules pass in opposite directions. Here we first survey the results about the computing power of membrane systems (P systems) using only symport/antiport rules (hence these systems compute by communication only), then we consider a recently introduced, way of defining the result of a computation in a membrane system: looking for the trace of certain objects in their movement through membranes. Rather unexpected, in this way we get characterizations of recursively enumerable languages by means of membrane systems with symport/antiport which work with multisets of objects (note the qualitative difference between the data structure used by computations – multisets: no ordering– and the data structure of the output – strings: linear ordering). A similar remark holds true for the case of analysing P systems, which work in an automata-like manner: the sequence of certain distinguished objects taken from the environment during acomputation is the string recognized by the computation. We also survey universality results from this area, with sketched proofs. Some open problems are also formulated.