Opened Access P systems with minimal parallelism

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Ciobanu, Gabriel
Pan, Linqiang
Paun, Gheorghe
Pérez Jiménez, Mario de Jesús
Departamento: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Fecha: 2007
Publicado en: Theoretical Computer Science, 378 (1), 117-130.
Tipo de documento: Artículo
Resumen: A current research topic in membrane computing is to find more realistic P systems from a biological point of view, and one target in this respect is to relax the condition of using the rules in a maximally parallel way. We contribute in this paper to this issue by considering the minimal parallelism of using the rules: if at least a rule from a set of rules associated with a membrane or a region can be used, then at least one rule from that membrane or region must be used, without any other restriction (e.g., more rules can be used, but we do not care how many). Weak as it might look, this minimal parallelism still leads to universality. We first prove this for the case of symport/antiport rules. The result is obtained both for generating and accepting P systems, in the latter case also for systems working deterministically. Then, we consider P systems with active membranes, and again the usual results are obtained: universality and the possibility to solve NP-complete problem...
[Ver más]
Cita: Ciobanu, G., Pan, L., Paun, G. y Pérez Jiménez, M.d.J. (2007). P systems with minimal parallelism. Theoretical Computer Science, 378 (1), 117-130.
Tamaño: 396.1Kb
Formato: PDF

URI: http://hdl.handle.net/11441/67973

DOI: 10.1016/j.tcs.2007.03.044

Ver versión del editor

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones