Rewriting P systems with conditional communication

Authors:
Paolo Bottoni;Anna Labella;Carlos Martín-Vide;Gheorghe Păun
Affiliations:
Department of Computer Science, University of Rome "La Sapienza", Via Salaria 113, 00198 Roma, Italy;Department of Computer Science, University of Rome "La Sapienza", Via Salaria 113, 00198 Roma, Italy;Research Group in Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005 Tarragona, Spain;Institute of Mathematics of the Romanian Academy, PO Box 1-764, 70700 Bucuresti, Romania
Venue:
Formal and natural computing
Year:
2002

Citing 8
Cited 5

Petri net algorithms in the theory of matrix grammars

Acta Informatica
Pattern control on derivations in context-free rewriting

Journal of Automata, Languages and Combinatorics
Computing with membranes

Journal of Computer and System Sciences
Computing with cells and atoms in a nutshells

Complexity
Handbook of Formal Languages

Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Computing with Membranes: Attacking NP-Complete Problems

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Computing with Membranes: P Systems with Worm-Objects

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)

A guide to membrane computing

Theoretical Computer Science - Natural computing
On three variants of rewriting P systems

Theoretical Computer Science
Rewriting P systems: improved hierarchies

Theoretical Computer Science
Tile pasting P system with multiple-edge pasting

SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Tile pasting systems for tessellation and tiling patterns

CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images

Quantified Score

Hi-index	0.00

Visualization

Abstract

A membrane system (P system) is a model of computation inspired by some basic features of the structure and behaviour of living cells. In this paper we consider systems with string-objects processed by rewriting, with the communication controlled by conditions on the contents of the strings. Symbols, snbstrings (in an arbitrary place, or as a prefix/suffix), or the shape of the whole string are used as permitting and as forbidding conditions when moving strings from a membrane to a neighboring membrane. Many of the obtained variants lead to new characterizations of recursively enumerable languages (as expected, these characterizations indicate a trade-off between the number of membranes and the strength of the communication conditions used). Several open problems are also formulated.