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
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
Tissue P systems with channel states
Theoretical Computer Science - Insightful theory
Computation: finite and infinite machines
Computation: finite and infinite machines
P systems with minimal parallelism
Theoretical Computer Science
Membrane Systems Using Noncooperative Rules with Unconditional Halting
Membrane Computing
A formal framework for static (tissue) P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
| Hi-index | 0.00 |
In addition to the maximally parallel transition mode used from the beginning in the area of membrane computing, many other transition modes for (tissue) P systems have been investigated since then. In this paper we consider (tissue) P systems with hybrid transition modes where each set of a covering of the whole set of rules may work in a different transition mode in a first level and all partitions of rules work together at a (second) level of the whole system on the current configuration in a maximally parallel way. With all partitions of noncooperative rules working in the maximally parallel mode, we obtain a characterization of Parikh sets of ET0L-languages, whereas with hybrid systems with the partitions either working in the maximally parallel and in the =1-mode or with all partitions working in the =1-mode we can simulate catalytic or purely catalytic P systems, respectively, thus obtaining computational completeness.