P Colonies Processing Strings

In this paper we introduce and study P colonies where the environment is given as a string. These constructs, called automaton-like P colonies or APCol systems, behave like automata: during functioning, the agents change their own states and process the symbols of the string. We show that the family...

Full description

Saved in:
Bibliographic Details
Published inFundamenta informaticae Vol. 134; no. 1-2; pp. 51 - 65
Main Authors Cienciala, Luděk, Ciencialová, Lucie, Csuhaj-Varjú, Erzsébet
Format Journal Article
LanguageEnglish
Published 2014
Subjects
Automation
Colonies
Construction
Jumping
Mathematical analysis
Projection
Strings
Symbols
Online AccessGet full text

Cover

More Information
Summary:In this paper we introduce and study P colonies where the environment is given as a string. These constructs, called automaton-like P colonies or APCol systems, behave like automata: during functioning, the agents change their own states and process the symbols of the string. We show that the family of -free languages accepted by jumping finite automata is properly included in the family of languages accepted by APCol systems with one agent and any -free recursively enumerable language can be obtained as a projection of a language accepted by an automaton-like P colony with two agents.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:0169-2968
DOI:10.3233/FI-2014-1090