P colonies processing strings

Luděk Cienciala, Lucie Ciencialová, E. Csuhaj-Varjú

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)51-65
Number of pages15
JournalFundamenta Informaticae
Volume134
Issue number1-2
DOIs
Publication statusPublished - 2014

Fingerprint

Automata
Strings
Processing
Recursively Enumerable Languages
Finite Automata
Finite automata
Projection
Language
Family

Keywords

  • automata
  • jumping finite automata
  • P colony
  • recursively enumerable language

ASJC Scopus subject areas

  • Information Systems
  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Algebra and Number Theory

Cite this

P colonies processing strings. / Cienciala, Luděk; Ciencialová, Lucie; Csuhaj-Varjú, E.

In: Fundamenta Informaticae, Vol. 134, No. 1-2, 2014, p. 51-65.

Research output: Contribution to journalArticle

Cienciala, L, Ciencialová, L & Csuhaj-Varjú, E 2014, 'P colonies processing strings', Fundamenta Informaticae, vol. 134, no. 1-2, pp. 51-65. https://doi.org/10.3233/FI-2014-1090
Cienciala, Luděk ; Ciencialová, Lucie ; Csuhaj-Varjú, E. / P colonies processing strings. In: Fundamenta Informaticae. 2014 ; Vol. 134, No. 1-2. pp. 51-65.
@article{24d2476b03524b5c81b5c83ad52782a4,
title = "P colonies processing strings",
abstract = "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.",
keywords = "automata, jumping finite automata, P colony, recursively enumerable language",
author = "Luděk Cienciala and Lucie Ciencialov{\'a} and E. Csuhaj-Varj{\'u}",
year = "2014",
doi = "10.3233/FI-2014-1090",
language = "English",
volume = "134",
pages = "51--65",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "1-2",

}

TY - JOUR

T1 - P colonies processing strings

AU - Cienciala, Luděk

AU - Ciencialová, Lucie

AU - Csuhaj-Varjú, E.

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - automata

KW - jumping finite automata

KW - P colony

KW - recursively enumerable language

UR - http://www.scopus.com/inward/record.url?scp=84912116549&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84912116549&partnerID=8YFLogxK

U2 - 10.3233/FI-2014-1090

DO - 10.3233/FI-2014-1090

M3 - Article

VL - 134

SP - 51

EP - 65

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 1-2

ER -