P systems with local graph productions

Authors:
Rudolf Freund;Marion Oswald
Affiliations:
Department of Computer Science, Technische Universität Wien, Wien, Austria;Department of Computer Science, Technische Universität Wien, Wien, Austria
Venue:
New Generation Computing - Membrane computing
Year:
2004

Citing 6
Cited 0

Computing with membranes

Journal of Computer and System Sciences
Hyperedge Replacement: Grammars and Languages

Hyperedge Replacement: Grammars and Languages
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Attributed Elementarz Programmed Graph Grammars

WG '91 Proceedings of the 17th International Workshop
Array-rewriting P systems

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

P systems (membrane systems) of various types so far mainly have been considered as computing devices working on multisets or strings. In this paper we investigate P systems with local graph productions generating weakly connected directed graphs. At least when equipped with a priority relation on the rules, such P systems can generate any recursively enumerable language of weakly connected directed graphs with only one membrane.