Cell-like P systems with evolutional symport/antiport rules and membrane creation
From MaRDI portal
Publication:2216105
DOI10.1016/j.ic.2020.104542zbMath1496.68144OpenAlexW3010414753MaRDI QIDQ2216105
Luis Valencia-Cabrera, Bosheng Song, David Orellana-Martín, Mario J. Pérez-Jiménez, KenLi Li
Publication date: 15 December 2020
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/107630
membrane computingbio-inspired computingmembrane creationcell-like P-systemevolutional symport/antiport rule
Related Items (18)
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 ⋮ Rule synchronization for monodirectional tissue-like P systems with channel states ⋮ From \texttt{SAT} to \texttt{SAT}-\texttt{UNSAT} using P systems with dissolution rules ⋮ Languages generated by numerical P systems with thresholds ⋮ Spiking neural P systems with weights and delays on synapses ⋮ Membrane creation and symport/antiport rules solving QSAT ⋮ From NP-completeness to DP-completeness: a membrane computing perspective ⋮ Numerical spiking neural P systems with production functions on synapses ⋮ Tissue P systems with promoter simulation with MeCoSim and P-Lingua framework ⋮ Computing with SN P systems with I/O mode ⋮ The computational power of cell-like P systems with one protein on membrane ⋮ Modeling diel vertical migration with membrane computing ⋮ Time-free cell-like P systems with multiple promoters/inhibitors ⋮ Rule synchronization for tissue P systems ⋮ The computational power of monodirectional tissue P systems with symport rules ⋮ Monodirectional tissue P systems with channel states ⋮ P systems with evolutional symport and membrane creation rules solving QSAT
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Flat maximal parallelism in P systems with promoters
- P systems with proteins on membranes characterize PSPACE
- The power of communication: P systems with symport/antiport
- Trading polarizations for labels in P systems with active membranes
- P systems with symport/antiport simulating counter automata
- Membrane computing and complexity theory: A characterization of PSPACE
- A uniform solution to SAT using membrane creation
- On small universal antiport P systems
- P systems with minimal parallelism
- Membrane fission versus cell division: when membrane proliferation is not enough
- A uniform family of tissue P systems with cell division solving 3-COL in a linear time
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
- Tissue P systems.
- Complexity classes in models of cellular computing with membranes
- Computing with membranes
- The computational complexity of tissue P systems with evolutional symport/antiport rules
- Membrane computing. An introduction.
- Tissue-like P systems with evolutional symport/antiport rules
- Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
- P systems attacking hard problems beyond NP: a survey
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes
- Time-free solution to SAT problem using P systems with active membranes
- An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Separation
- A time-free uniform solution to subset sum problem by tissue P systems with cell division
- Time-Free Spiking Neural P Systems
- COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES
- Towards a Characterization of P Systems with Minimal Symport/Antiport and Two Membranes
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- Membrane Computing
- Membrane Computing
This page was built for publication: Cell-like P systems with evolutional symport/antiport rules and membrane creation
