Carriers and counters: P systems with carriers vs. (blind) counter automata

Authors:
Hendrik Jan Hoogeboom
Affiliations:
Institute for Advanced Computer Science, Universiteit Leiden, The Netherlands
Venue:
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Year:
2002

Citing 6
Cited 4

Petri net algorithms in the theory of matrix grammars

Acta Informatica
Computing with membranes

Journal of Computer and System Sciences
Membrane systems with carriers

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Simulating Counter Automata by P Systems with Symport/Antiport

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

Simulating Counter Automata by P Systems with Symport/Antiport

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
The conformon-P system: a molecular and cell biology-inspired computability model

Theoretical Computer Science
Communication membrane systems with active symports

Journal of Automata, Languages and Combinatorics
Infinite hierarchies of conformon-p systems

WMC'06 Proceedings of the 7th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

P systems with carriers are shown to be computationally complete with only a single membrane and two carriers. We argue that their power is due to the maximal parallelism required in the application of the rules. In fact, with a single carrier, these systems are equivalent to blind counter automata. Finally, with a single passenger restriction the systems are again computationally complete.