P automata with restricted power

Erzsébet Csuhaj-Varjú, György Vaszil

Research output: Contribution to journalArticle

2 Citations (Scopus)


P automata are variants of symport/antiport membrane systems which describe string languages by applying a mapping to the sequence of multisets entering the system during computations. In this paper, we study their computational power in the case when the input mapping associates each input multiset with the set of strings consisting of all permutations of its elements. We show that P automata of this type are strictly less powerful than so-called restricted logarithmic space Turing machines, and we also exhibit a strict infinite hierarchy within the accepted language class based on the number of membranes present in the system.

Original languageEnglish
Pages (from-to)391-408
Number of pages18
JournalInternational Journal of Foundations of Computer Science
Issue number4
Publication statusPublished - Jun 2014



  • P automata
  • P systems
  • logarithmic workspace

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this