Asynchronous and maximally parallel deterministic controlled non-cooperative p systems characterize NFIN and coNFIN

Authors:
Artiom Alhazov;Rudolf Freund
Affiliations:
Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chişinău, Moldova, Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi d ...;Faculty of Informatics, Vienna University of Technology, Vienna, Austria
Venue:
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Year:
2012

Citing 10
Cited 0

Handbook of formal languages, vol. 3: beyond words

Handbook of formal languages, vol. 3: beyond words
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Toward a Formal Macroset Theory

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Computationally universal P systems without priorities: two catalysts are sufficient

Theoretical Computer Science - Descriptional complexity of formal systems
Computation: finite and infinite machines

Computation: finite and infinite machines
Deterministic catalytic systems are not universal

Theoretical Computer Science - Implementation and application of automata
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing
A general framework for regulated rewriting based on the applicability of rules

Computation, cooperation, and life
Ultimately confluent rewriting systems. parallel multiset–rewriting with permitting or forbidding contexts

WMC'04 Proceedings of the 5th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Membrane systems (with symbol objects) are distributed controlled multiset processing systems. Non-cooperative P systems with either promoters or inhibitors (of weight not restricted to one) are known to be computationally complete. In this paper we show that the power of the deterministic subclass of such systems is computationally complete in the sequential mode, but only subregular in the asynchronous mode and in the maximally parallel mode.