P colonies processing strings

Luděk Cienciala, Lucie Ciencialová, Erzsébet Csuhaj-Varjú

Research output: Contribution to journalArticle

2 Citations (Scopus)


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
Issue number1-2
Publication statusPublished - Jan 1 2014


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

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'P colonies processing strings'. Together they form a unique fingerprint.

  • Cite this