Communicative P Systems with Minimal Cooperation

Alhazov, Artiom; Margenstern, Maurice; Rogozhin, Vladimir; Rogozhin, Yurii; Verlan, Sergey

doi:10.1007/978-3-540-31837-8_9

Cited by 14 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [17] it is shown that three membranes are sufficient to generate all recursively enumerable sets of numbers using 5 superfluous objects in the output membrane. In [3], a stronger result is reported where the output membrane did not contain superfluous objects.…”

Section: Introductionmentioning

confidence: 94%

“…Similarly, when minimal symport is used, i.e., when only symport rules dealing with at most two objects are permitted, three membranes suffice to generate all recursively enumerable sets of numbers [3]. A recent result shows that this number can be decreased down to two for both minimal symport and minimal antiport cases [1], yet only modulo a terminal alphabet.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

MINIMAL COOPERATION IN SYMPORT/ANTIPORT TISSUE P SYSTEMS

Alhazov

Rogozhin

Verlan

2007

Int. J. Found. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

We investigate tissue P systems with symport/antiport with minimal cooperation, i.e., when only 2 objects may interact. We show that 2 cells are enough in order to generate all recursively enumerable sets of numbers. Moreover, constructed systems simulate register machines and have purely deterministic behavior. We also investigate systems with one cell and we show that they may generate only finite sets of numbers.

show abstract

Section: Introductionmentioning

confidence: 94%

Section: Introductionmentioning

confidence: 99%

MINIMAL COOPERATION IN SYMPORT/ANTIPORT TISSUE P SYSTEMS

Alhazov

Rogozhin

Verlan

2007

Int. J. Found. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…A relevant contribution was also made within other types of P systems, as it would be the case of the implementation of catalytic P systems presented in [42], and the simulator for maximally parallel multiset-rewriting systems with promoters/inhibitors in [43], used to prove theorems presented in [44,45]. Other simulator developed during those early years in membrane computing was SubLP-Studio, for both L and P systems (see [46], available at [147]).…”

Section: First Steps Of Simulation In Membrane Computingmentioning

confidence: 99%

An interactive timeline of simulators in membrane computing

et al. 2019

View full text Add to dashboard Cite

As with any fast-emerging research front in computer science, the proliferation of theoretical and practical results within Membrane computing since its appearance in 1998 was astonishing. As a consequence, it became necessary during the subsequent years to produce several surveys collecting the main achievements from a theoretical point of view, along with some specific surveys about simulation tools for this paradigm. As the discipline has reached a certain degree of maturity, more practical applications have arisen, and new collective works are summarising the new software products appeared. However, while these recapitulation efforts remain useful for details about new simulators, they cannot act as exhaustive updated listings, as they become obsolete as soon as new tools are developed. Thus, we considered that it was necessary to provide an interactive tool showing an updated timeline (https ://www.gcn.us.es/Simul ation MC) about the simulation of the computational devices of membrane computing (a.k.a P systems), aiming to stay updated whenever any new practical work comes out in the discipline. This paper recalls the main stages and milestones within the evolution of simulation tools for different types and variants of P systems, along with their main related applications. In addition, it describes the interactive web tool with the timeline mentioned, where all the references related here have been incorporated. Unlike other survey papers, it is the intent of this work to reinforce this initial collective effort with the web endpoint kept alive and updated.

show abstract

“…In particular, purely communicative tissue P systems with symport/antiport were investigated in Pȃun (2002) by showing completeness results for systems using rules with different sizes and different structures for the underlying graph. More recently, Alhazov et al (2005) proved that tissue P systems with symport/antiport rules of a minimal size (that is, rules of the form (a, in), (a, out) or (a, out; b, in), with a, b objects from a given alphabet) are computationally complete, and that two cells suffice. Verlan et al (2006) considered tissue P systems with conditional uniport, meaning that every application of a communication rule moves one object in a certain direction by, possibly, using another one as an activator, which is left unchanged in the place where it is.…”

Section: Introductionmentioning

confidence: 99%

(Tissue) P systems with cell polarity

Besozzi¹,

Busi²,

Cazzaniga³

et al. 2009

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

We consider the structure of the intestinal epithelial tissue and of cell–cell junctions as the biological model inspiring a new class of P systems. First we define the concept of cell polarity, a formal property derived from epithelial cells, which present morphologically and functionally distinct regions of the plasma membrane. Then we show two preliminary results for this new model of computation: on the theoretical side, we show that P systems with cell polarity are computationally (Turing) complete; on the modelling side, we show that the transepithelial movement of glucose from the intestinal lumen into the blood can be described by such a formal system. Finally, we define tissue P systems with cell polarity, where each cell has fixed connections to the neighbouring cells and to the environment, according to both the cell polarity and specific cell–cell junctions.

show abstract

Communicative P Systems with Minimal Cooperation

Cited by 14 publications

References 7 publications

MINIMAL COOPERATION IN SYMPORT/ANTIPORT TISSUE P SYSTEMS

MINIMAL COOPERATION IN SYMPORT/ANTIPORT TISSUE P SYSTEMS

An interactive timeline of simulators in membrane computing

(Tissue) P systems with cell polarity

Contact Info

Product

Resources

About