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

Towards P Colonies Processing Strings

 

Advanced Search
 
Opened Access Towards P Colonies Processing Strings
Cites
Show item statistics
Icon
Export to
Author: Cienciala, Ludec
Ciencialová, Lucie
Csuhaj Varjú, Erzsébet
Date: 2014
Published in: Proceedings of the Twelfth Brainstorming Week on Membrane Computing, 103-118, Sevilla, E.T.S. de Ingeniería Informática, 3-7 de Febrero, 2014,
ISBN/ISSN: 978-84-940056-4-0
Document type: Presentation
Abstract: In this paper we introduce and study P colonies where the environment is given as a string. These variants of P colonies, called Automaton-like P systems or APCol systems, behave like automata: during functioning, the agents change their own states and process the symbols of the string. After introducing the concept of APCol systems, we examine their computational power. It is shown that the family of languages accepted by jumping nite automata is properly included in the family of languages accepted by APCol systems with one agent, and it is proved that any recursively enumerable language can be obtained as a projection of a language accepted by an Automaton-like P colony with two agents.
Size: 269.4Kb
Format: PDF

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

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

This item appears in the following Collection(s)