P systems with minimal parallelism
From MaRDI portal
Publication:884455
DOI10.1016/j.tcs.2007.03.044zbMath1118.68066WikidataQ57937180 ScholiaQ57937180MaRDI QIDQ884455
Gabriel Ciobanu, Mario J. Pérez-Jiménez, Lin-Qiang Pan, Gheorghe Păun
Publication date: 6 June 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.044
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Strategy-Based Proof Calculus for Membrane Systems, A Multiscale Modeling Framework Based on P Systems, Simple Neural-Like P Systems for Maximal Independent Set Selection, A Formal Framework for Static (Tissue) P Systems, Flat maximal parallelism in P systems with promoters, Investigating dynamic causalities in reaction systems, P systems with proteins on membranes characterize PSPACE, Asynchronous P systems with active membranes, Catalytic and communicating Petri nets are Turing complete, Numerical P systems with production thresholds, A toolbox for simpler active membrane algorithms, (Tissue) P systems working in the \(k\)-restricted minimally or maximally parallel transition mode, Lattice based communication P systems with applications in cluster analysis, Membrane computing and brane calculi. Old, new, and future bridges, How derivation modes and halting conditions may influence the computational power of P systems, Synchronization of rules in membrane computing, An improved universal spiking neural P system with generalized use of rules, Rule synchronization for tissue P systems, The computational power of monodirectional tissue P systems with symport rules, Modelling of DNA mismatch repair with a reversible process calculus, Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division, Cell-like P systems with evolutional symport/antiport rules and 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, Cell-like P systems with polarizations and minimal rules, A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division, The computational power of enzymatic numerical P systems working in the sequential mode, A proof theoretic view of spatial and temporal dependencies in biochemical systems, The computational power of tissue-like P systems with promoters, Complexity aspects of polarizationless membrane systems, Rule synchronization for monodirectional tissue-like P systems with channel states, Homogeneous spiking neural P systems working in sequential mode induced by maximum spike number, P Systems with Active Membranes Operating under Minimal Parallelism, P SYSTEMS WITH PROTEINS ON MEMBRANES: A SURVEY, PARTIAL HALTING IN P SYSTEMS, Computing with cells: membrane systems – some complexity issues, MODULAR ASSEMBLY OF CELL SYSTEMS BIOLOGY MODELS USINGPSYSTEMS, Simple, Enhanced and Mutual Mobile Membranes
Cites Work
