Repositorio de producción científica de la Universidad de Sevilla

On the Power of Deterministic EC P Systems

 

Advanced Search
 
Opened Access On the Power of Deterministic EC P Systems
Cites
Show item statistics
Icon
Export to
Author: Alhazov, Artiom
Date: 2004
Published in: Proceedings of the Second Brainstorming Week on Membrane Computing, 11-15. Sevilla, E.T.S. de Ingeniería Informática, 2-7 de Febrero, 2004
ISBN/ISSN: 84-688-6101-4
Document type: Presentation
Abstract: It is commonly believed that a signi¯cant part of the computational power of membrane systems comes from their inherent non-determinism. Re- cently, R. Freund and Gh. P¸aun have considered deterministic P systems, and formulated the general question whether the computing (generative) capacity of non-deterministic P systems is strictly larger than the (recognizing) capacity of their deterministic counterpart. In this paper, we study the computational power of deterministic P systems in the evolution{communication framework. It is known that, in the genera- tive case, two membranes are enough for universality. For the deterministic systems, we obtain the universality with three membranes, leaving the original problem open.
Size: 98.08Kb
Format: PDF

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

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)