On maximal parallel application of rules in rewriting P systems
From MaRDI portal
Publication:6535162
DOI10.1007/s41965-023-00127-8zbMATH Open1543.68127MaRDI QIDQ6535162
Publication date: 14 November 2023
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Grammars and rewriting systems (68Q42) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- P systems with active membranes: Trading time for space
- Non-confluence in divisionless P systems with active membranes
- Membrane computing and complexity theory: A characterization of PSPACE
- Petri net algorithms in the theory of matrix grammars
- On three variants of rewriting P systems
- Array-rewriting P systems
- Computing with membranes
- Real-life applications with membrane computing
- Hierarchies of parallel rewriting P systems -- a survey
- Membrane computing. An introduction.
- A Turing machine simulation by P systems without charges
- Bounding the space in P systems with active membranes
- Coping with dynamical reaction system topologies using deterministic P modules: a case study of photosynthesis
- Modeling diel vertical migration with membrane computing
- Reliability evaluation of distribution network based on fuzzy spiking neural P system with self-synapse
- Alternative space definitions for P systems with active membranes
- Membrane computing models and robot controller design, current results and challenges
- When catalytic P systems with one catalyst can be computationally complete
- Turing completeness of water computing
- Characterizing PSPACE with shallow non-confluent P systems
- Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
- P colonies. Survey
- P systems attacking hard problems beyond NP: a survey
- Characterising the complexity of tissue P systems with fission rules
- Space complexity equivalence of P systems with active membranes and Turing machines
- P systems with active membranes: Attacking NP-complete problems
- A note on parallel rewriting in P systems
- Rewriting P Systems with Flat-Splicing Rules
- P Systems with Elementary Active Membranes: Beyond NP and coNP
- PSYSTEMS WITH ACTIVE MEMBRANES WORKING IN POLYNOMIAL SPACE
- P SYSTEMS WITH INPUT IN BINARY FORM
- Sublinear-Space P Systems with Active Membranes
- PROBABILISTIC REWRITING P SYSTEMS
- DNA Computing
- Membrane Computing
- A web-based visual simulator for spiking neural P systems
- Neighbourhood message passing computation on a lattice with cP systems
- Solving 3-SAT in distributed P systems with string objects
- Evaluating space measures in P systems
- Weighted spiking neural P systems with polarizations and anti-spikes
- A key agreement protocol based on spiking neural P systems with anti-spikes
Related Items (4)
Developments in Language Theory ⋮ Unnamed Item ⋮ Sequential and maximally parallel multiset rewriting: reversibility and determinism ⋮ Hierarchies of parallel rewriting P systems -- a survey
This page was built for publication: On maximal parallel application of rules in rewriting P systems
