On the power of P automata

E. Csuhaj-Varjú, György Vaszil

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

We study the computational power of P automata, variants of symport/antiport P systems which characterize string languages by applying a mapping to the sequence of multisets entering the system during computations. We consider the case when the input mapping is defined in such a way that it maps a multiset to the set of strings consisting of all permutations of its elements. We show that the computational power of this type of P automata is strictly less 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
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages55-66
Number of pages12
Volume7956 LNCS
DOIs
Publication statusPublished - 2013
Event12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013 - Milan, Italy
Duration: Jul 1 2013Jul 5 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7956 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013
CountryItaly
CityMilan
Period7/1/137/5/13

Fingerprint

Automata
Multiset
Turing machines
Strings
P Systems
Turing Machine
Membranes
Logarithmic
Permutation
Membrane
Strictly
Language
Class
Hierarchy

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Csuhaj-Varjú, E., & Vaszil, G. (2013). On the power of P automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7956 LNCS, pp. 55-66). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7956 LNCS). https://doi.org/10.1007/978-3-642-39074-6-7

On the power of P automata. / Csuhaj-Varjú, E.; Vaszil, György.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7956 LNCS 2013. p. 55-66 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7956 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Csuhaj-Varjú, E & Vaszil, G 2013, On the power of P automata. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7956 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7956 LNCS, pp. 55-66, 12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013, Milan, Italy, 7/1/13. https://doi.org/10.1007/978-3-642-39074-6-7
Csuhaj-Varjú E, Vaszil G. On the power of P automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7956 LNCS. 2013. p. 55-66. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-39074-6-7
Csuhaj-Varjú, E. ; Vaszil, György. / On the power of P automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7956 LNCS 2013. pp. 55-66 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{5a6d1184ae994c3da5c6e4006f3c5015,
title = "On the power of P automata",
abstract = "We study the computational power of P automata, variants of symport/antiport P systems which characterize string languages by applying a mapping to the sequence of multisets entering the system during computations. We consider the case when the input mapping is defined in such a way that it maps a multiset to the set of strings consisting of all permutations of its elements. We show that the computational power of this type of P automata is strictly less 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.",
author = "E. Csuhaj-Varj{\'u} and Gy{\"o}rgy Vaszil",
year = "2013",
doi = "10.1007/978-3-642-39074-6-7",
language = "English",
isbn = "9783642390739",
volume = "7956 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "55--66",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - On the power of P automata

AU - Csuhaj-Varjú, E.

AU - Vaszil, György

PY - 2013

Y1 - 2013

N2 - We study the computational power of P automata, variants of symport/antiport P systems which characterize string languages by applying a mapping to the sequence of multisets entering the system during computations. We consider the case when the input mapping is defined in such a way that it maps a multiset to the set of strings consisting of all permutations of its elements. We show that the computational power of this type of P automata is strictly less 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 - We study the computational power of P automata, variants of symport/antiport P systems which characterize string languages by applying a mapping to the sequence of multisets entering the system during computations. We consider the case when the input mapping is defined in such a way that it maps a multiset to the set of strings consisting of all permutations of its elements. We show that the computational power of this type of P automata is strictly less 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.

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

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

U2 - 10.1007/978-3-642-39074-6-7

DO - 10.1007/978-3-642-39074-6-7

M3 - Conference contribution

SN - 9783642390739

VL - 7956 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 55

EP - 66

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -