P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
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
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
Membrane computing and complexity theory: A characterization of PSPACE
Journal of Computer and System Sciences
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
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
Characterizing tractability by tissue-like p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Tissue p systems with cell separation: upper bound by PSPACE
TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
| Hi-index | 0.00 |
Tissue P systems generalize the membrane structure tree usual in original models of P systems to an arbitrary graph. Basic operations in these systems are communication rules, enriched in some variants with cell division or cell separation. Several variants of tissue P systems were recently studied, together with the concept of uniform families of these systems. Their computational power was shown to range between P and NP∪co−NP, thus characterizing some interesting borderlines between tractability and intractability. In this paper we show that computational power of these uniform families in polynomial time is limited by the class PSPACE. This class characterizes the power of many classical parallel computing models.