A look back at some early results in membrane computing

Authors:
Oscar H. Ibarra
Affiliations:
Department of Computer Science, University of California
Venue:
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Year:
2009

Citing 10
Cited 0

Computing with membranes

Journal of Computer and System Sciences
Computing with cells and atoms in a nutshells

Complexity
Membrane Computing: An Introduction

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

New Generation Computing
Computationally universal P systems without priorities: two catalysts are sufficient

Theoretical Computer Science - Descriptional complexity of formal systems
On membrane hierarchy in P systems

Theoretical Computer Science
On determinism versus nondeterminism in P systems

Theoretical Computer Science
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems

Theoretical Computer Science
Deterministic catalytic systems are not universal

Theoretical Computer Science - Implementation and application of automata
On bounded symport/antiport P systems

DNA'05 Proceedings of the 11th international conference on DNA Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

On this tenth anniversary of the Workshop on Membrane Computing, it seems appropriate and fitting to look back at some early basic contributions in the area. We give a brief summary of results, some of which answered fundamental open questions in the field. These concern complexity issues such as universality versus non-universality, determinism versus nondeterminism, various notions of parallelism, membrane and alphabet-size hierarchies, and characterizations of some classes of P systems.