P automata with restricted power

E. Csuhaj-Varjú, György Vaszil

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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
Volume25
Issue number4
DOIs
Publication statusPublished - 2014

Fingerprint

Membranes
Turing machines

Keywords

  • logarithmic workspace
  • P automata
  • P systems

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

P automata with restricted power. / Csuhaj-Varjú, E.; Vaszil, György.

In: International Journal of Foundations of Computer Science, Vol. 25, No. 4, 2014, p. 391-408.

Research output: Contribution to journalArticle

@article{766a5163bcd3415a8b71b4477e458df7,
title = "P automata with restricted power",
abstract = "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.",
keywords = "logarithmic workspace, P automata, P systems",
author = "E. Csuhaj-Varj{\'u} and Gy{\"o}rgy Vaszil",
year = "2014",
doi = "10.1142/S0129054114400024",
language = "English",
volume = "25",
pages = "391--408",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "4",

}

TY - JOUR

T1 - P automata with restricted power

AU - Csuhaj-Varjú, E.

AU - Vaszil, György

PY - 2014

Y1 - 2014

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

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

KW - logarithmic workspace

KW - P automata

KW - P systems

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

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

U2 - 10.1142/S0129054114400024

DO - 10.1142/S0129054114400024

M3 - Article

AN - SCOPUS:84905968587

VL - 25

SP - 391

EP - 408

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 4

ER -