P systems without multiplicities of symbol-objects

Authors:
Artiom Alhazov
Affiliations:
Institute of Mathematics and Computer Science, Academy of Science of Moldova, Chisinau, MD, Moldova and Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tà ...
Venue:
Information Processing Letters
Year:
2006

Citing 5
Cited 4

Handbook of Formal Languages

Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction

Membrane Computing: An Introduction
P Systems with Boundary Rules

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Evolution-Communication P Systems

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing

P systems with minimal parallelism

Theoretical Computer Science
Properties of membrane systems

CMC'11 Proceedings of the 12th international conference on Membrane Computing
Membrane Systems with Qualitative Evolution Rules

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Polarizationless P systems with active membranes working in the minimally parallel mode

UC'07 Proceedings of the 6th international conference on Unconventional Computation

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper we investigate P systems whose compartments contain sets of symbol-objects rather than multisets of objects, as it is common in membrane computing. If the number of membranes cannot grow, then in this framework we can characterize exactly the regular languages. If membrane creation or membrane division is allowed, then the Parikh sets of recursively enumerable languages can be generated. The last result also implies the universality of P systems with active membranes (with multisets of symbol-objects) without polarizations.