Open AccessJournal Article
Further Results on Contextual and Rewriting P Systems
TLDR
This paper improves a universality result avoiding the extended feature and by using rules of small weight in contextual P systems and has two (rather surprising) universality results, both of them using three membranes for non-extended systems with replicated rewriting and with leftmost rewriting.Abstract:
In this paper, we continue the study of contextual and rewriting P systems. In contextual P systems, we improve a universality result avoiding the extended feature and by using rules of small weight. In rewriting P systems, we have two (rather surprising) universality results, both of them using three membranes, for non-extended systems with replicated rewriting and with leftmost rewriting, respectively.read more
Citations
More filters
Book ChapterDOI
Introduction to Membrane Computing
TL;DR: This is a comprehensive (and friendly) introduction to membrane computing (MC), meant to offer both computer scientists and non-computer scientists an up-to-date overview of the field.
Journal ArticleDOI
P Systems with Mobile Membranes
TL;DR: This paper investigates the power and the efficiency of P systems with active membranes by first proving that they can simulate and give a direct and simple proof for the universality result – without using division rules.
Membrane models of biological systems
TL;DR: Rewriting rules model biochemical reactions between elements of the multiset defining the state of the system at each instant, consistent with the idea of employing multisets as a representation formalism for undistinguishable floating chemical molecules uniformly distributed and randomly moving in a common environment.
Membrane systems with limited parallelism
Andrei Păun,Bianca Popa +1 more
TL;DR: Another new variant of membrane systems that uses context-free rewriting rules for the evolution of objects placed inside compartments of a cell, and symport rules for communication between membranes are introduced, which prove that these rewriting-symport P systems generate all recursively enumerable languages.
Proceedings ArticleDOI
Contextual iso-triangular array P system and hexagonal picture languages
TL;DR: The main interesting study is that makes use of contextual iso triangular array erasing rules of contextualiso triangular array P system, the star picture is generated and its power in generating the hexagonal picture languages is investigated.
References
More filters
Book
Membrane Computing: An Introduction
TL;DR: This chapter discusses Membrane Computing, What It Is and What It is Not, and attempts to get back to reality with open problems and Universality results.
Book
Regulated rewriting in formal language theory
Jrgen Dassow,Gheorghe Paun +1 more
TL;DR: This book presents 25 different regulating mechanisms by definitions, examples and basic facts, especially concerning hierarchies, as well as selective substitution grammars as one common generalization.
Book
Marcus Contextual Grammars
Gheorghe Paun,Gheorghe Pun +1 more
TL;DR: 1. Origin and Motivation, Formal Language Theory Prerequisites, and A Generalization: n-Contextual Grammars.
Proceedings ArticleDOI
Contextual grammars
TL;DR: Every finite sequence of elements in ia called a vocnbuV is said to be a s t r i n g o n V, which is a finite set of strings on the vocabulary V~ and let@be a finite se@ of contexts on V.