Non-cooperative p systems with priorities characterize PsET0L

Authors:
Dragoş Sburlan
Affiliations:
Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain
Venue:
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Year:
2005

Citing 4
Cited 1

Computing with membranes

Journal of Computer and System Sciences
Handbook of Formal Languages

Handbook of Formal Languages
Mathematical Theory of L Systems

Mathematical Theory of L Systems
Membrane Computing: An Introduction

Membrane Computing: An Introduction

P systems with chained rules

CMC'11 Proceedings of the 12th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper answers an open problem from [4], proving that transition P systems with non-cooperative rules using priorities generate exactly the Parikh images of ET0L languages.