Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Simulating Counter Automata by P Systems with Symport/Antiport
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Modelling biological processes by using a probabilistic P system software
Natural Computing: an international journal
Minimizing evolution-communication P systems and automata
New Generation Computing - Membrane computing
Results on catalytic and evolution-communication P systems
New Generation Computing - Membrane computing
P systems without multiplicities of symbol-objects
Information Processing Letters
Membrane Systems with Peripheral Proteins: Transport and Evolution
Electronic Notes in Theoretical Computer Science (ENTCS)
A multiset-based model of synchronizing agents: Computability and robustness
Theoretical Computer Science
Decision problems in membrane systems with peripheral proteins, transport and evolution
Theoretical Computer Science
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
(tissue) p systems with cell polarity
Mathematical Structures in Computer Science
Partial halting in P systems using membrane rules with permitting contexts
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Psim: a computational platform for metabolic P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Biological roots and applications of p systems: further suggestions
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Tissue p systems with communication modes
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Number of protons/bi-stable catalysts and membranes in p systems. time-freeness
WMC'05 Proceedings of the 6th international conference on Membrane Computing
A novel variant of p systems for the modelling and simulation of biochemical systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Membrane computing — current results and future problems
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Basic concurrency resolution in clock-free p systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
P systems for traffic flow simulation
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
Hi-index | 0.00 |
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).This type of P system is realistic for (at least) three different reasons: we do not have target indications in the evolution rules, we use very simple symport/antiport rules to realize communication, and we do not need objects available in the environment at the beginning of a computation. Somewhat expected, this new variant is still universal. We prove the universality in two cases: when using catalytic rules (but only one catalyst), symport/antiport rules of weight one, and two membranes, and when we use three membranes, symport/antiport rules of weight one, and no catalyst. Especially the latter result is of interest, because the catalysts were used in most universality proofs for P systems with symbol-objects. Also new is the proof technique we use: we start from programmed grammars with unconditional transfer.