Multi-dimensional descriptional complexity of P systems

Authors:
Miguel A. Gutiérrez-Naranjo;Mario J. Pérez-Jiménez;Agustín Riscos-Núñez
Affiliations:
Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Spain
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2007

Citing 4
Cited 0

Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport

New Generation Computing
On descriptive complexity of p systems

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Membrane Computing is a branch of Natural Computing which starts from the assumption that the processes taking place in the compartmental structure of a living cell can be interpreted as computations. The description of the complexity of the computations of the membrane devices (P systems) is a hard task which goes beyond the usual parameters of time and space. This is especially hard in the case of P systems where the number of membranes increases along the computation, via division or creation of membranes. In this paper we show that a four-dimensional carpet can be a useful tool to describe and compare evolutions of P systems, even in such cases.