dc.creator | Valencia Cabrera, Luis | es |
dc.creator | Orellana Martín, David | es |
dc.creator | Martínez del Amor, Miguel Ángel | es |
dc.creator | Riscos Núñez, Agustín | es |
dc.creator | Pérez Jiménez, Mario de Jesús | es |
dc.date.accessioned | 2021-12-01T09:07:45Z | |
dc.date.available | 2021-12-01T09:07:45Z | |
dc.date.issued | 2016 | |
dc.identifier.citation | Valencia Cabrera, L., Orellana Martín, D., Martínez del Amor, M.Á., Riscos Núñez, A. y Pérez Jiménez, M.d.J. (2016). Polarizationless P Systems with Active Membranes: Computational Complexity Aspects. Journal of Automata, Languages and Combinatorics, 21 (1-2), 107-123. | |
dc.identifier.issn | 1430-189X | es |
dc.identifier.uri | https://hdl.handle.net/11441/127862 | |
dc.description.abstract | P systems with active membranes, in their classical definition, make use of noncooperative
rules only. However, it is well known that in living cells, proteins interact
among them yielding new products. Inspired by this biological phenomenon,
the previous framework is reformulated in this paper, allowing cooperation in object
evolution rules, while removing electrical charges associated with membranes. More
precisely, minimal cooperation in object evolution rules is incorporated in polarizationless
P systems with active membranes. In this paper, the term “minimal” means that
the left-hand side of such rules consists of at most two symbols, and its length is greater
than or equal to the corresponding right-hand side. The computational efficiency of
this kind of P systems is studied by providing a uniform polynomial-time solution to
SAT problem in such manner that only division rules for elementary membranes are used
and dissolution rules are forbidden. Bearing in mind that only tractable problems can
be efficiently solved by families of polarizationless P systems with active membranes
and without dissolution rules, passing from non-cooperation to minimal cooperation in
object evolution rules amounts passing from non-efficiency to efficiency in this framework.
This frontier of efficiency provides, as any other borderline does, a possible way
to address the P versus NP problem. | es |
dc.description.sponsorship | National Natural Science Foundation of China No. 61033003 | es |
dc.description.sponsorship | National Natural Science Foundation of China No. 61320106005 | es |
dc.format | application/pdf | es |
dc.format.extent | 17 | es |
dc.language.iso | eng | es |
dc.publisher | Institut für Informatik, Justus-Liebig-Universität Giessen | es |
dc.relation.ispartof | Journal of Automata, Languages and Combinatorics, 21 (1-2), 107-123. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Membrane computing | es |
dc.subject | Active membranes | es |
dc.subject | Minimal cooperation | es |
dc.subject | Mitosis | es |
dc.subject | Computational complexity | es |
dc.subject | the P versus NP problem | es |
dc.title | Polarizationless P Systems with Active Membranes: Computational Complexity Aspects | es |
dc.type | info:eu-repo/semantics/article | es |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial | es |
dc.relation.projectID | No. 61033003 | es |
dc.relation.projectID | No. 61320106005 | es |
dc.relation.publisherversion | https://www.jalc.de/issues/2016/issue_21_1-2/jalc-2016-107-123.php | es |
dc.identifier.doi | 10.25596/jalc-2016-107 | es |
dc.contributor.group | Universidad de Sevilla. TIC193 : Computación Natural | es |
dc.journaltitle | Journal of Automata, Languages and Combinatorics | es |
dc.publication.volumen | 21 | es |
dc.publication.issue | 1-2 | es |
dc.publication.initialPage | 107 | es |
dc.publication.endPage | 123 | es |
dc.identifier.sisius | 20978748 | es |
dc.contributor.funder | National Natural Science Foundation of China | es |