Membrane creation and symport/antiport rules solving QSAT
In Membrane Computing, diferent variants of devices can be found by changing both syntactical and semantic ingredients. These devices are usually called membrane systems or P systems, and they recall the structure and behavior of living cells in the nature. In this sense, rules are introduced as a w...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2022 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/143999 |
| Acceso en línea: | https://hdl.handle.net/11441/143999 https://doi.org/10.1007/s41965-022-00104-7 |
| Access Level: | acceso abierto |
| Palabra clave: | Membrane computing Membrane creation QSAT Computational complexity theory |
| Sumario: | In Membrane Computing, diferent variants of devices can be found by changing both syntactical and semantic ingredients. These devices are usually called membrane systems or P systems, and they recall the structure and behavior of living cells in the nature. In this sense, rules are introduced as a way for objects to interact with membranes, giving P systems the ability to solve computational problems. Some of these rules, as division, separation and creation rules are inspired by the membrane division through the mitosis process or new membranes are created through gemmation. These rules seem to be crucial in the path to solve computationally hard problems. In this work, creation rules are used in classical P systems with symport/ antiport rules, where objects travel through membranes without changing to achieve enough computational power to efciently solve PSPACE-complete problems. More precisely, a solution to the QSAT problem is given by means of a uniform family of these systems. This paper was originally submitted to the International Conference on Membrane Computing 2021. |
|---|