Flat maximal parallelism in P systems with promoters
From MaRDI portal
Publication:264535
DOI10.1016/J.TCS.2015.10.027zbMATH Open1336.68073OpenAlexW1770254410MaRDI QIDQ264535FDOQ264535
Authors: Gheorghe Păun, Bosheng Song, Linqiang Pan 
Publication date: 31 March 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.027
Recommendations
Cites Work
- Title not available (Why is that?)
- Computing with membranes
- Membrane computing. An introduction.
- Title not available (Why is that?)
- Title not available (Why is that?)
- FURTHER RESULTS ON P SYSTEMS WITH PROMOTERS/INHIBITORS
- Promoters and inhibitors in purely catalytic P systems
- A polynomial complexity class in P systems using membrane division
- Fast hardware implementations of P systems
- ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
- Unconventional Computation
- (Tissue) P systems working in the \(k\)-restricted minimally or maximally parallel transition mode
- Characterizing tractability by tissue-like P systems
- P systems with minimal parallelism
Cited In (22)
- A formal framework for spiking neural P systems
- Solving the SAT problem by cell-like P systems with channel states and symport rules
- The computational complexity of tissue P systems with evolutional symport/antiport rules
- The computational power of monodirectional tissue P systems with symport rules
- Spiking neural P systems: main ideas and results
- Spiking neural P systems with rules on synapses and anti-spikes
- The computational power of tissue-like P systems with promoters
- Rule synchronization for tissue P systems
- Cell-like P systems with evolutional symport/antiport rules and membrane creation
- Flattening the transition P systems with dissolution
- Monodirectional tissue P systems with channel states
- Spiking neural P systems with a flat maximally parallel use of rules
- Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes
- Cell-like P systems with polarizations and minimal rules
- Tissue-like P systems with evolutional symport/antiport rules
- Communication P systems with channel states working in flat maximally parallel manner
- Rule synchronization for monodirectional tissue-like P systems with channel states
- Developments in Language Theory
- The computational power of enzymatic numerical P systems working in the sequential mode
- Flattening in (tissue) P systems
- P systems working in maximal variants of the set derivation mode
This page was built for publication: Flat maximal parallelism in P systems with promoters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264535)
