The power of synchronizing rules in membrane computing
From MaRDI portal
Publication:6118652
DOI10.1016/j.ins.2022.02.014OpenAlexW4212830575MaRDI QIDQ6118652
Publication date: 28 February 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2022.02.014
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficiently solving the bin packing problem through bio-inspired mobility
- Mobility in process calculi and natural computing.
- Trading polarizations for labels in P systems with active membranes
- Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
- Quorum sensing P systems
- A uniform solution to SAT using membrane creation
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
- Simulating a P system based efficient solution to SAT by using GPUs
- Complexity classes in models of cellular computing with membranes
- Denotational semantics of membrane systems by using complete metric spaces
- Real-life applications with membrane computing
- Faster synchronization in P systems
- Computationally universal P systems without priorities: Two catalysts are sufficient
- Membrane computing. An introduction.
- Synchronization of rules in membrane computing
- Rule synchronization for tissue P systems
- Adaptive P systems
- Solving HPP and SAT by P systems with active membranes and separation rules
- Describing the Immune System Using Enhanced Mobile Membranes
- Flattening the Transition P Systems with Dissolution
- Turing Completeness Using Three Mobile Membranes
- Handbook of Natural Computing
- Fast Synchronization in P Systems
- A Kernel P Systems Survey
This page was built for publication: The power of synchronizing rules in membrane computing
