Petri nets: an introduction
Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
University of the chirp-firing game
Theoretical Computer Science
Journal of Computer and System Sciences
Membrane systems with carriers
Theoretical Computer Science
Membrane Computing: An Introduction
Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport
New Generation Computing
P Systems with Activated/Prohibited Membrane Channels
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
P Automata or Purely Communicating Accepting P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Cell communication in tissue P systems: universality results
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Computation: finite and infinite machines
Computation: finite and infinite machines
On self-assembly in population p systems
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Computational power of symport/antiport: history, advances, and open problems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Generalized communicating P systems
Theoretical Computer Science
(tissue) p systems with cell polarity
Mathematical Structures in Computer Science
On generalized communicating P systems with minimal interaction rules
Theoretical Computer Science
Look-Ahead evolution for p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Properties of membrane systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
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 |
The paper introduces (purely communicative) tissue P systems with conditional uniport. Conditional uniport means that rules move only one object at a time, but this may be with the help of another one acting as an activator which is left untouched in the place where it is. Tissue P systems with conditional uniport are shown to be computationally complete in the sense that they can recognize all recursively enumerable sets of natural numbers. This is achieved by simulating deterministic register machines.