A Direct Construction of a Universal P System

Authors:
Pierluigi Frisco;Hendrik Jan Hoogeboom;Paul Sant
Affiliations:
L.I.A.C.S., Leiden University, Niels Bohwerg 1, 2333 CA Leiden, The Netherlands;L.I.A.C.S., Leiden University, Niels Bohwerg 1, 2333 CA Leiden, The Netherlands;Department of Computer Science, Kings College, Strand, London, United Kingdom
Venue:
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Year:
2002

Citing 7
Cited 0

Regular extended H systems are computationally universal

Journal of Automata, Languages and Combinatorics
Computing with membranes

Journal of Computer and System Sciences
On membrane computing based on splicing

Where mathematics, computer science, linguistics and biology meet
P Systems with Valuations

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
P Systems with Membrane Creation: Universality and Efficiency

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
A Direct Construction of a Universal Extended H System

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a direct universal P system based on splicing. Our approach differs from those shown in previous papers as the P system we construct takes as input an encoding of another P system. Previous results were based on the simulation of universal type-0 grammars or Turing machines. We think that the approach we use can be applied to other variants of P systems.