Reducing the size of extended gemmating p systems

Authors:
Erzsébet Csuhaj-Varjú;György Vaszil
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary;Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary
Venue:
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Year:
2004

Citing 6
Cited 0

Computing with membranes

Journal of Computer and System Sciences
Handbook of Formal Languages

Handbook of Formal Languages
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Context-Free-Like Forms for the Phrase-Structure Grammars

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
P Systems with Gemmation of Mobile Membranes

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Gemmating P systems: collapsing hierarchies

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We improve some results concerning the size of P systems with gemmation of mobile membranes. We show that systems with meta-priority relations and without (in/out) communication rules generate any recursively enumerable language with three membranes, thus we present an optimal result on the necessary number of membranes to obtain computational completeness. In the case of gemmating P systems with only pre-dynamical rules, we prove that four membranes are sufficient to generate any recursively enumerable language.