Artículos (Ciencias de la Computación e Inteligencia Artificial)https://hdl.handle.net/11441/113022019-02-16T18:03:45Z2019-02-16T18:03:45ZSeeking Sharper Frontiers of Efficiency in Tissue P Systems: in the collective paper, Research frontiers in Membrane Computing: Open problems and research topics.https://hdl.handle.net/11441/797532018-11-02T10:12:08Z2013-01-01T00:00:00ZSeeking Sharper Frontiers of Efficiency in Tissue P Systems: in the collective paper, Research frontiers in Membrane Computing: Open problems and research topics.
2013-01-01T00:00:00Z3-Col problem modelling using simple kernel P systemshttps://hdl.handle.net/11441/797522018-11-02T09:46:43Z2013-01-01T00:00:00Z3-Col problem modelling using simple kernel P systems
This paper presents the newly introduced class of (simple) kernel P systems ((s)kP systems) and investigates
through a 3-colouring problem case study the expressive power and efficiency of kernel P systems. It
describes two skP systems that model the problem and analyses them in terms of efficiency and complexity.
The skP models prove to be more succinct (in terms of number of rules, objects, number of cells and
execution steps) than the corresponding tissue P system, available in the literature, that solves the same
problem, at the expense of a greater length of the rules.
2013-01-01T00:00:00ZA polynomial alternative to unbounded environment for tissue P systems with cell divisionhttps://hdl.handle.net/11441/797512018-11-02T08:31:45Z2013-01-01T00:00:00ZA polynomial alternative to unbounded environment for tissue P systems with cell division
The standard definition of tissue P systems includes a special alphabet whose elements are assumed to appear
in the initial configuration of the system in an arbitrarily large number of copies. These objects reside in a
distinguished place of the system, called the environment. Such potentially infinite supply of objects seems
an unfair tool when designing efficient solutions to computationally hard problems in the framework of
membrane computing, by performing a space–time trade-off. This paper deals with computational aspects
of tissue P systems with cell division where there is no environment having the property mentioned above.
Specifically, we prove that the polynomial complexity classes associated with tissue P systems with cell
division and with or without environment are actually identical. As a consequence, we conclude that it is
not necessary to have infinitely many copies of some objects in the initial configuration in order to solve
NP–complete problems in an efficient way.
2013-01-01T00:00:00ZForeword. Special Issue: A selection of papers from the 10th Brainstorming Week on Membrane Computinghttps://hdl.handle.net/11441/797492018-11-02T08:15:43Z2013-01-01T00:00:00ZForeword. Special Issue: A selection of papers from the 10th Brainstorming Week on Membrane Computing
2013-01-01T00:00:00Z