Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Journal of Computer and System Sciences
Networks of language processors
Current trends in theoretical computer science
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Toward a Formal Macroset Theory
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
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
The Oxford Handbook of Membrane Computing
The Oxford Handbook of Membrane Computing
A formal framework for static (tissue) P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
(Tissue) P systems working in the k-restricted minimally or maximally parallel transition mode
Natural Computing: an international journal
Extended spiking neural p systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Transition and halting modes in (tissue) p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Fundamenta Informaticae
| Hi-index | 0.00 |
Objects generated in P systems usually are assumed to survive as long as the computation goes on. In this paper, decaying objects are considered, i.e., objects only surviving a bounded number of computation steps. Variants of (tissue) P systems with decaying objects working in transition modes where the number of rules applied in each computation step is bounded, are shown to be very restricted in their generative power, i.e., if the results are collected in a specified output cell/membrane, then only finite sets of multisets can be generated, and if the results are specified by the objects sent out into the environment, we obtain the regular sets. Only if the decaying objects are regenerated within a certain period of computation steps, i.e., if we allow an unbounded number of rules to be applied, then computational completeness can be obtained, yet eventually more ingredients are needed for the rules than in the case of non-decaying objects, e.g., permitting and/or forbidden contexts. As special variants of P systems, catalytic P systems, P systems using cooperative rules, and spiking neural P systems are investigated.