Computing with membranes
From MaRDI portal
Publication:1582013
DOI10.1006/jcss.1999.1693zbMath0956.68055OpenAlexW2158708642MaRDI QIDQ1582013
Publication date: 11 January 2001
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3a89b4566c541302925fd446466137025c06b473
Related Items (only showing first 100 items - show all)
Breaking DES using P systems. ⋮ On the power of membrane division in P systems ⋮ From regulated rewriting to computing with membranes: collapsing hierarchies ⋮ The conformon-P system: a molecular and cell biology-inspired computability model ⋮ Catalytic P systems, semilinear sets, and vector addition systems ⋮ Computational completeness of spiking neural P systems with inhibitory rules for generating string languages ⋮ Variants of derivation modes for which purely catalytic P systems are computationally complete ⋮ Modelling of DNA mismatch repair with a reversible process calculus ⋮ Hilbert words as arrays generated with P systems ⋮ When catalytic P systems with one catalyst can be computationally complete ⋮ Turing completeness of water computing ⋮ An efficient labelled nested multiset unification algorithm ⋮ Formal verification of cP systems using Coq ⋮ Spiking neural P systems with a flat maximally parallel use of rules ⋮ Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete ⋮ Computational power of sequential spiking neural P systems with multiple channels ⋮ Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division ⋮ Asynchronous homogenous spiking neural P systems with local rule synchronization ⋮ Spiking neural P systems with multiple channels ⋮ Using membrane computing for effective homology ⋮ Spiking neural P systems with polarizations and rules on synapses ⋮ Cell-like P systems with evolutional symport/antiport rules and membrane creation ⋮ Computational power of dynamic threshold neural P systems for generating string languages ⋮ Automata complete computation with Hodgkin-Huxley neural networks composed of synfire rings ⋮ Dendrite P systems ⋮ A Turing machine simulation by P systems without charges ⋮ Formal verification of cP systems using PAT3 and ProB ⋮ Tissue P systems with promoter simulation with MeCoSim and P-Lingua framework ⋮ Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion ⋮ Mutual exclusion and reversibility in reaction systems ⋮ Simulating reversible computation with reaction systems ⋮ A survey of gene regulatory networks modelling methods: from differential equations, to Boolean and qualitative bioinspired models ⋮ Computing with SN P systems with I/O mode ⋮ Sequential dynamic threshold neural P systems ⋮ Simulating counting oracles with cooperation ⋮ Solving a PSPACE-complete problem with cP systems ⋮ Seeking computational efficiency boundaries: the Păun's conjecture ⋮ The computational power of cell-like P systems with one protein on membrane ⋮ Description of membrane systems with time Petri nets: promoters/inhibitors, membrane dissolution, and priorities ⋮ Generating pictures in string representation with P systems: the case of space-filling curves ⋮ From P systems to morphogenetic systems: an overview and open problems ⋮ P systems with limited number of objects ⋮ Homogeneous spiking neural P systems with structural plasticity ⋮ Modeling diel vertical migration with membrane computing ⋮ Reliability evaluation of distribution network based on fuzzy spiking neural P system with self-synapse ⋮ Theory of reaction automata: a survey ⋮ Division rules for tissue P systems inspired by space filling curves ⋮ Spiking neural P systems: matrix representation and formal verification ⋮ A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators ⋮ How derivation modes and halting conditions may influence the computational power of P systems ⋮ A survey of results on evolution-communication P systems with energy ⋮ Search-based testing in membrane computing ⋮ Hyperparameter optimization in learning systems ⋮ Control languages accepted by labeled spiking neural P systems with rules on synapses ⋮ Time-free solution to SAT problem by tissue P systems ⋮ Small SNQ P systems with multiple types of spikes ⋮ Emergence of random selections in evolution of biological populations ⋮ Fundamental results for learning deterministic extended finite state machines from queries ⋮ Reducing control alphabet size for the control of right linear grammars with unknown behaviors ⋮ Proof techniques in membrane computing ⋮ Spiking neural P systems with target indications ⋮ Accepting networks of evolutionary processors with subregular filters ⋮ Time-free solution to SAT problem by P systems with active membranes and standard cell division rules ⋮ Hierarchies of parallel rewriting P systems -- a survey ⋮ A Prolog simulator for deterministic P systems with active membranes ⋮ P systems with local graph productions ⋮ Results on catalytic and evolution-communication P systems ⋮ Computationally universal P systems without priorities: Two catalysts are sufficient ⋮ Spiking neural P systems with structural plasticity and anti-spikes ⋮ On membrane hierarchy in P systems ⋮ Rewriting P systems: improved hierarchies ⋮ Testing based on identifiable P systems using cover automata and X-machines ⋮ P systems with randomized right-hand sides of rules ⋮ Two notes on APCol systems ⋮ P systems with symport/antiport rules: when do the surroundings matter? ⋮ When object production tunes the efficiency of membrane systems ⋮ 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 with proteins: a new frontier when membrane division disappears ⋮ Rule synchronization for tissue P systems ⋮ The computational power of monodirectional tissue P systems with symport rules ⋮ Neural-like P systems with plasmids ⋮ Computational completeness of sequential spiking neural P systems with inhibitory rules ⋮ Nonlinear neural P systems for generating string languages ⋮ Monodirectional tissue P systems with channel states ⋮ Generalized forbidding matrix grammars and their membrane computing perspective ⋮ Parallel contextual array insertion deletion P systems and tabled matrix grammars ⋮ Triangular array token Petri net and P system ⋮ P system as a computing tool for embedded feature selection and classification method for microarray cancer data ⋮ Partial array token Petri net and \(P\) system ⋮ Certain state sequences defined by P systems with reactions ⋮ On numerical 2D P colonies with the blackboard and the gray wolf algorithm ⋮ Comparison of pandemic intervention policies in several building types using heterogeneous population model ⋮ Depth-two P systems can simulate Turing machines with \textbf{NP} oracles ⋮ Synthesising elementary net systems with localities ⋮ Topics in the theory of DNA computing. ⋮ A guide to membrane computing. ⋮ From networks of reaction systems to communicating reaction systems and back ⋮ P systems with evolutional communication and separation rules ⋮ Processing natural language with biomolecules: where linguistics, biology and computation meet
Cites Work
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- The chemical abstract machine
- 2-testability and relabelings produce everything
- On the computational completeness of context-free parallel communicating grammar systems
- Petri net algorithms in the theory of matrix grammars
- Mobile ambients
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing with membranes
