Formal languages
Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Minds and Machines
The power of communication: P systems with symport/antiport
New Generation Computing
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
Computation: finite and infinite machines
Computation: finite and infinite machines
Normal forms for spiking neural P systems
Theoretical Computer Science
Events and modules in reaction systems
Theoretical Computer Science
Introducing time in reaction systems
Theoretical Computer Science
The Oxford Handbook of Membrane Computing
The Oxford Handbook of Membrane Computing
Towards bridging two cell-inspired models: P systems and R systems
Theoretical Computer Science
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Fundamenta Informaticae
| Hi-index | 0.00 |
This paper continues an investigation into bridging two research areas concerned with natural computing: membrane computing and reaction systems. More specifically, the paper considers a transfer of two assumptions/axioms of reaction systems, non-permanency and the threshold assumption, into the framework of membrane computing. It is proved that: 1 spiking neural P systems with non-permanency of spikes assumption characterize the semilinear sets of numbers, and 2 symport/antiport P systems with threshold assumption translated as ω multiplicity of objects can solve SAT in polynomial time. Also, several open research problems are stated.