A Prolog simulator for deterministic P systems with active membranes
From MaRDI portal
Recommendations
- Decidability of termination problems for sequential P systems with active membranes
- An efficient simulation of polynomial-space Turing machines by P systems with active membranes
- Formal verification of P systems with active membranes through model checking
- A parallel prolog system for distributed memory
- scientific article; zbMATH DE number 3900171
- The computational power of timed P systems with active membranes using promoters
- Strategy-based proof calculus for membrane systems
- Computational efficiency and universality of timed P systems with active membranes
- Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes
Cites work
- scientific article; zbMATH DE number 3967882 (Why is no real title available?)
- scientific article; zbMATH DE number 4072431 (Why is no real title available?)
- scientific article; zbMATH DE number 1735650 (Why is no real title available?)
- scientific article; zbMATH DE number 1951572 (Why is no real title available?)
- scientific article; zbMATH DE number 1951575 (Why is no real title available?)
- scientific article; zbMATH DE number 1455628 (Why is no real title available?)
- A guide to membrane computing.
- A polynomial complexity class in P systems using membrane division
- Computing with membranes
- Membrane computing. An introduction.
Cited in
(2)
This page was built for publication: A Prolog simulator for deterministic P systems with active membranes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762939)