Petri net algorithms in the theory of matrix grammars
Acta Informatica
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems
Mathematical Theory of L Systems
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On Synchronization in P Systems
Fundamenta Informaticae
GP Systems with Forbidding Context
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
DNA and Membrane Algorithms for SAT
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
A C Library for Simulating P Systems
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Simulating Turing Machines by P Systems with External Output
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Hi-index | 0.00 |
A membrane computing system (also called P system) consists of computing cells which are organized hierarchically by the inclusion relation: cells may include cells, which again may include cells, etc. Each cell is enclosed by its membrane. Each cell is an independent computing agent with its own computing program, which produces objects. The interaction between cells consists of the exchange of objects through membranes. The output of a computation is a partially ordered set of objects which leave the system through its external membrane. The fundamental properties of computations in such P systems with external output are investigated. These include the computing power, normal forms, and basic decision problems.