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
Journal of Computer and System Sciences
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)
Computing with Membranes (P Systems): Universality Results
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
P systems and picture languages
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
| Hi-index | 0.00 |
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, substrings (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.