On maximal parallel application of rules in rewriting P systems
From MaRDI portal
Publication:6535162
Recommendations
Cites work
- scientific article; zbMATH DE number 193524 (Why is no real title available?)
- scientific article; zbMATH DE number 1951579 (Why is no real title available?)
- scientific article; zbMATH DE number 1951598 (Why is no real title available?)
- scientific article; zbMATH DE number 1953228 (Why is no real title available?)
- scientific article; zbMATH DE number 1738659 (Why is no real title available?)
- scientific article; zbMATH DE number 2087502 (Why is no real title available?)
- scientific article; zbMATH DE number 3802813 (Why is no real title available?)
- scientific article; zbMATH DE number 2201367 (Why is no real title available?)
- A Turing machine simulation by P systems without charges
- A key agreement protocol based on spiking neural P systems with anti-spikes
- A note on parallel rewriting in P systems
- A web-based visual simulator for spiking neural P systems
- Alternative space definitions for P systems with active membranes
- Array-rewriting P systems
- Bounding the space in P systems with active membranes
- Characterising the complexity of tissue P systems with fission rules
- Characterizing PSPACE with shallow non-confluent P systems
- Computing with membranes
- Coping with dynamical reaction system topologies using deterministic P modules: a case study of photosynthesis
- DNA Computing
- Evaluating space measures in P systems
- Hierarchies of parallel rewriting P systems -- a survey
- Membrane Computing
- Membrane computing and complexity theory: A characterization of PSPACE
- Membrane computing models and robot controller design, current results and challenges
- Membrane computing. An introduction.
- Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
- Modeling diel vertical migration with membrane computing
- Neighbourhood message passing computation on a lattice with cP systems
- Non-confluence in divisionless P systems with active membranes
- On three variants of rewriting P systems
- P SYSTEMS WITH INPUT IN BINARY FORM
- P colonies. Survey
- P systems attacking hard problems beyond NP: a survey
- P systems with active membranes working in polynomial space
- P systems with active membranes: Attacking NP-complete problems
- P systems with active membranes: Trading time for space
- PROBABILISTIC REWRITING P SYSTEMS
- Petri net algorithms in the theory of matrix grammars
- P Systems with Elementary Active Membranes: Beyond NP and coNP
- Real-life applications with membrane computing
- Reliability evaluation of distribution network based on fuzzy spiking neural P system with self-synapse
- Rewriting P systems with flat-splicing rules
- Solving 3-SAT in distributed P systems with string objects
- Space complexity equivalence of P systems with active membranes and Turing machines
- Sublinear-space P systems with active membranes
- Turing completeness of water computing
- Weighted spiking neural P systems with polarizations and anti-spikes
- When catalytic P systems with one catalyst can be computationally complete
Cited in
(4)
This page was built for publication: On maximal parallel application of rules in rewriting P systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535162)
