On the computational complexity of P automata

Erzsébet Csuhaj-Varjú, Oscar H. Ibarra, György Vaszil

Research output: Contribution to journalConference article

13 Citations (Scopus)

Abstract

We characterize the classes of languages described by P automata, i.e., accepting P systems with communication rules only. Motivated by properties of natural computing systems, we study computational complexity classes with a certain restriction on the use of the available workspace in the course of computations and relate these to the language classes described by P automata. We prove that if the rules of the P system are applied sequentially, then the accepted language class is strictly included in the class of languages accepted by one-way Turing machines with a logarithmically bounded workspace, and if the rules are applied in the maximal parallel manner, then the class of context-sensitive languages is obtained.

Original languageEnglish
Pages (from-to)76-89
Number of pages14
JournalLecture Notes in Computer Science
Volume3384
DOIs
Publication statusPublished - Jan 1 2005
Event10th International Workshop on DNA Computing, DNA 10 - Milan, Italy
Duration: Jun 7 2004Jun 10 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the computational complexity of P automata'. Together they form a unique fingerprint.

  • Cite this