On the computational complexity of P automata

E. Csuhaj-Varjú, Oscar H. Ibarra, György Vaszil

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

We characterize the classes of languages over finite alphabets which may be described by P automata, i.e., accepting P systems with communication rules only. Motivated by properties of natural computing systems, and the actual behavior of P automata, 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 maximally parallel manner, then the class of context-sensitive languages is obtained.

Original languageEnglish
Pages (from-to)109-126
Number of pages18
JournalNatural Computing
Volume5
Issue number2
DOIs
Publication statusPublished - May 2006

Fingerprint

Context sensitive languages
Turing machines
Computational complexity
Communication

Keywords

  • Accepting P systems
  • Communicating P systems
  • Context-sensitive languages
  • P automata
  • Sub-logarithmic space complexity

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

On the computational complexity of P automata. / Csuhaj-Varjú, E.; Ibarra, Oscar H.; Vaszil, György.

In: Natural Computing, Vol. 5, No. 2, 05.2006, p. 109-126.

Research output: Contribution to journalArticle

Csuhaj-Varjú, E. ; Ibarra, Oscar H. ; Vaszil, György. / On the computational complexity of P automata. In: Natural Computing. 2006 ; Vol. 5, No. 2. pp. 109-126.
@article{3cee768174494ddd8b2037d2700d5199,
title = "On the computational complexity of P automata",
abstract = "We characterize the classes of languages over finite alphabets which may be described by P automata, i.e., accepting P systems with communication rules only. Motivated by properties of natural computing systems, and the actual behavior of P automata, 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 maximally parallel manner, then the class of context-sensitive languages is obtained.",
keywords = "Accepting P systems, Communicating P systems, Context-sensitive languages, P automata, Sub-logarithmic space complexity",
author = "E. Csuhaj-Varj{\'u} and Ibarra, {Oscar H.} and Gy{\"o}rgy Vaszil",
year = "2006",
month = "5",
doi = "10.1007/s11047-005-4461-1",
language = "English",
volume = "5",
pages = "109--126",
journal = "Natural Computing",
issn = "1567-7818",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - On the computational complexity of P automata

AU - Csuhaj-Varjú, E.

AU - Ibarra, Oscar H.

AU - Vaszil, György

PY - 2006/5

Y1 - 2006/5

N2 - We characterize the classes of languages over finite alphabets which may be described by P automata, i.e., accepting P systems with communication rules only. Motivated by properties of natural computing systems, and the actual behavior of P automata, 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 maximally parallel manner, then the class of context-sensitive languages is obtained.

AB - We characterize the classes of languages over finite alphabets which may be described by P automata, i.e., accepting P systems with communication rules only. Motivated by properties of natural computing systems, and the actual behavior of P automata, 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 maximally parallel manner, then the class of context-sensitive languages is obtained.

KW - Accepting P systems

KW - Communicating P systems

KW - Context-sensitive languages

KW - P automata

KW - Sub-logarithmic space complexity

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

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

U2 - 10.1007/s11047-005-4461-1

DO - 10.1007/s11047-005-4461-1

M3 - Article

AN - SCOPUS:33745164941

VL - 5

SP - 109

EP - 126

JO - Natural Computing

JF - Natural Computing

SN - 1567-7818

IS - 2

ER -