Cell communication in tissue \(P\) systems: universality results
From MaRDI portal
Publication:2576606
DOI10.1007/s00500-004-0393-4zbMath1101.68574OpenAlexW2076209553MaRDI QIDQ2576606
Francesco Bernardini, Marian Gheorghe
Publication date: 13 December 2005
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-004-0393-4
Related Items (19)
Computing with viruses ⋮ A Uniform Family of Tissue P Systems with Protein on Cells Solving 3-Coloring in Linear Time ⋮ A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time ⋮ A time-free uniform solution to subset sum problem by tissue P systems with cell division ⋮ Computational power of dynamic threshold neural P systems for generating string languages ⋮ A limitation of cell division in tissue P systems by PSPACE ⋮ Computational power of cell separation in tissue P systems ⋮ A uniform family of tissue P systems with cell division solving 3-COL in a linear time ⋮ Generalized communicating P systems ⋮ Time-free solution to SAT problem by tissue P systems ⋮ A multiset-based model of synchronizing agents: Computability and robustness ⋮ Tissue P systems with cell separation: attacking the partition problem ⋮ Computational complexity of tissue-like P systems ⋮ P systems attacking hard problems beyond NP: a survey ⋮ The computational power of monodirectional tissue P systems with symport rules ⋮ Computational completeness of sequential spiking neural P systems with inhibitory rules ⋮ Cell-like spiking neural P systems with evolution rules ⋮ (Tissue) P systems with cell polarity ⋮ A Linear–time Tissue P System Based Solution for the 3–coloring Problem
Cites Work
This page was built for publication: Cell communication in tissue \(P\) systems: universality results
