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

Tissue-like P Systems with Channel-States

 

Advanced Search
 
Opened Access Tissue-like P Systems with Channel-States
Cites
Show item statistics
Icon
Export to
Author: Freund, Rudolf
Paun, Gheorghe
Pérez Jiménez, Mario de Jesús
Department: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Date: 2004
Published in: Proceedings of the Second Brainstorming Week on Membrane Computing, 206-223. Sevilla, E.T.S. de Ingeniería Informática, 2-7 de Febrero, 2004
ISBN/ISSN: 84-688-6101-4
Document type: Presentation
Abstract: We consider tissue-like P systems with states associated with the links (we call them synapses) between cells, controlling the passage of objects across the links. We investigate the computing power of such devices for the case of using - in a sequential manner - antiport rules of small weights. Sys- tems with two cells are proven to be universal when having arbitrarily many states and minimal antiport rules, or two states, and antiport rules of weight two. Also the systems with arbitrarily many cells, three states, and minimal antiport rules are universal. In contrast, the systems with one cell and any number of states and rules of any weight only compute Parikh sets of ma- trix languages (generated by matrix grammars without appearance checking); characterizations of Parikh images of matrix languages are obtained for such one-cell systems with antiport rules of a reduced weight. A series of open problems are also formulated.
Size: 190.7Kb
Format: PDF

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

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

This item appears in the following Collection(s)