Relating Computations in Non-cooperative Transition P Systems and Evolution-Communication P Systems with Energy

Abstract

This paper explores the relation of computations in Evolution-Communication P systems with energy (ECPe systems) and non-cooperative Transition P systems without dissolution (TP systems). We have shown that for every non-cooperative TP system, we can construct an ECPe system that, (i) generates the same language, and (ii) each halting computation that takes τ steps in the TP system can be simulated in at most 3τ + 1 steps in its corresponding ECPe system.