The Expressiveness of Concentration Controlled P Systems

Authors:
Shankara Narayanan Krishna
Affiliations:
Department of Computer Science & Engineering, , Mumbai, India 400 076
Venue:
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Year:
2008

Citing 10
Cited 0

Formal languages

Formal languages
Computing with membranes

Journal of Computer and System Sciences
P systems with communication based on concentration

Acta Cybernetica
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction

Membrane Computing: An Introduction
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Results on catalytic and evolution-communication P systems

New Generation Computing - Membrane computing
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
On pure catalytic p systems

UC'06 Proceedings of the 5th international conference on Unconventional Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study concentration controlled P systems having catalysts, bi-stable catalysts and mobile catalysts. We show that computational universality can be obtained for pure catalytic P systems using 2 bi-stable catalysts and 1 membrane, improving the known universality result [2]. We also give universality results using catalysts, and mobile catalysts. Further, we identify some subclasses of these which are not computationally complete.