Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport
New Generation Computing
A New Class of Symbolic Abstract Neural Nets: Tissue P Systems
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Computing with Membranes: Attacking NP-Complete Problems
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Tissue P Systems with Contextual and Rewriting Rules
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Theoretical Computer Science
Complexity classes in models of cellular computing with membranes
Natural Computing: an international journal
Tissue P systems with channel states
Theoretical Computer Science - Insightful theory
Cell communication in tissue P systems: universality results
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Applications of Membrane Computing (Natural Computing Series)
Applications of Membrane Computing (Natural Computing Series)
A uniform family of tissue P systems with cell division solving 3-COL in a linear time
Theoretical Computer Science
Computational complexity of tissue-like P systems
Journal of Complexity
A polynomial complexity class in P systems using membrane division
Journal of Automata, Languages and Combinatorics
A linear solution for QSAT with membrane creation
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Tissue p systems with antiport rules and small numbers of symbols and cells
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Hi-index | 0.00 |
The classical definition of tissue P systems includes a distinguished alphabet with the special assumption that its elements are available in an arbitrarily large amount of copies. These objects are shared in a distinguished place of the system, called the environment. This ability of having infinitely many copies of some objects has been widely exploited in the design of efficient solutions to computationally hard problems by means of tissue P systems. This paper deals with computational aspects of tissue P systems with cell separation where there is no such environment as described above. The main result is that only tractable problems can be efficiently solved by using this kind of P systems. Bearing in mind that NP---complete problems can be efficiently solved by using tissue P systems without environment and with cell division, we deduce that in the framework of tissue P systems without environment, the kind of rules (separation versus division) provides a new frontier of the tractability of decision problems.