Computational efficiency and universality of timed P systems with active membranes

DOI10.1016/J.TCS.2014.10.051zbMath1314.68130OpenAlexW1968290756MaRDI QIDQ487991

Bosheng Song, Lin-Qiang Pan

Publication date: 23 January 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.051

zbMATH Keywords

universalitymembrane computingP systemSATactive membranetime-free solution

Mathematics Subject Classification ID

Related Items (9)

An efficient time-free solution to SAT problem by P systems with proteins on membranes ⋮ The computational power of tissue-like P systems with promoters ⋮ A Uniform Family of Tissue P Systems with Protein on Cells Solving 3-Coloring in Linear Time ⋮ The computational power of enzymatic numerical P systems working in the sequential mode ⋮ The computational power of timed P systems with active membranes using promoters ⋮ Time-free solution to SAT problem by tissue P systems ⋮ Computational efficiency and universality of timed P systems with membrane creation ⋮ Tissue-like P systems with evolutional symport/antiport rules ⋮ Solution to PSPACE-complete problem using P systems with active membranes with time-freeness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes
• Tissue P systems.
• Computing with membranes
• Membrane computing. An introduction.
• Time-free solution to SAT problem using P systems with active membranes
• Further remark on P systems with active membranes and two polarizations
• Time-Free Spiking Neural P Systems
• COMPUTATION OF RAMSEY NUMBERS BY P SYSTEMS WITH ACTIVE MEMBRANES
• Membrane Computing
• RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS

This page was built for publication: Computational efficiency and universality of timed P systems with active membranes