As already considered in [13], we investigate P systems where each evolution rule "produces" or "consumes" some quantity of energy, in amounts which are expressed as integer numbers. Yet in contrast to P systems with energy accounting as considered in [13], for energy-controlled P systems we demand that in each evolution step and in each membrane the total energy consumed by the application of a multiset of evolution rules has to be the maximum possible within a specific non-negative range. Only equipped with this control feature, energy-controlled P systems are very powerful. In the case of multisets of symbol objects we find that energy-controlled P systems with even only one membrane and an energy range of {0, 1} for the total energy involved in an evolution step characterize the recursively enumerable sets of vectors of natural numbers (without using catalysts or priorities or membrane dissolving features). In the case of string objects similar results can be obtained. Energy-controlled P systems with even only one membrane and the minimal energy range of {0} for the total energy involved in an evolution step at least generate any set of vectors of natural numbers that can be generated by matrix grammars without appearance checking.
[1]
Gheorghe Paun,et al.
P systems with energy accounting
,
2001,
Int. J. Comput. Math..
[2]
Gheorghe Paun,et al.
Membrane Computing with External Output
,
2000,
Fundam. Informaticae.
[3]
Rudolf Freund,et al.
Molecular Computing with Generalized Homogeneous P-Systems
,
2000,
DNA Computing.
[4]
Christel Baier,et al.
On Topological Hierarchies of Temporal Properties
,
1997,
Fundam. Informaticae.
[5]
G Paun,et al.
Computing with Membranes (P Systems): Twenty Six Research Topics
,
2000
.
[6]
Gheorghe Paun,et al.
Regulated Rewriting in Formal Language Theory
,
1989
.
[7]
Grzegorz Rozenberg,et al.
Handbook of Formal Languages
,
1997,
Springer Berlin Heidelberg.
[8]
Gheorghe Paun,et al.
Computing with Membranes
,
2000,
J. Comput. Syst. Sci..
[9]
Rudolf Freund,et al.
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
,
2001,
MCU.
[10]
Gheorghe Paun,et al.
On the Power of Membrane Computing
,
1999,
J. Univers. Comput. Sci..
[11]
Gheorghe Paun,et al.
Computing with Membranes: An Introduction
,
1999,
Bull. EATCS.
[12]
Gheorghe Paun,et al.
Membrane Computing
,
2002,
Natural Computing Series.