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

A Note on a New Class of APCol Systems

 

Advanced Search
 
Opened Access A Note on a New Class of APCol Systems
Cites
Show item statistics
Icon
Export to
Author: Ciencialová, Lucie
Csuhaj Varjú, Erzsébet
Vaszil, György
Date: 2018
Published in: BWMC 2018: Sixteenth Brainstorming Week on Membrane Computing (2018), p 59-68
Document type: Presentation
Abstract: We introduce a new acceptance mode for APCol systems (Automaton-like P colonies), variants of P colonies where the environment of the agents is given by a string and during functioning the agents change their own states and process the string similarly to automata. In case of the standard variant, the string is accepted if it can be reduced to the empty word. In this paper, we de ne APCol systems where the agents verify their environment, a model resembling multihead nite automata. In this case, a string of length n is accepted if during every halting computation the length of the environmental string in the con gurations does not change and in the course of the computation every agent applies a rule to a symbol on position i of some of the environmental strings for every i, 1 < i < n at least once. We show that these verifying APCol systems simulate one-way multihead nite automata.
Cite: Ciencialová, L., Csuhaj Varjú, E. y Vaszil, G. (2018). A Note on a New Class of APCol Systems. En BWMC 2018: Sixteenth Brainstorming Week on Membrane Computing (59-68), Sevilla, España: Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática.
Size: 82.26Kb
Format: PDF

URI: https://hdl.handle.net/11441/83713

See editor´s version

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

This item appears in the following Collection(s)