Computing with membranes
From MaRDI portal
New models of massive parallel computation devices are suggested. The basic idea of these devices is the modelling of the evolution of a family of cells. It is a modification of DNA-computers or neural networks or abstract chemistry machines. Three versions of the device are defined, the first one computes subsets of natural numbers, the second (or third) type of the device computes subsets of strings -- languages -- using rewriting (or splicing) rules. It is proved that all suggested models compute exactly recursive enumerable sets, even strong restricted conditions on them are given. Some open problems concerning effectiveness of computations are formulated.
Recommendations
Cites work
- 2-testability and relabelings produce everything
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- scientific article; zbMATH DE number 23841 (Why is no real title available?)
- scientific article; zbMATH DE number 3569855 (Why is no real title available?)
- scientific article; zbMATH DE number 1236223 (Why is no real title available?)
- scientific article; zbMATH DE number 1343487 (Why is no real title available?)
- scientific article; zbMATH DE number 2050952 (Why is no real title available?)
- scientific article; zbMATH DE number 1543318 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 745858 (Why is no real title available?)
- Mobile ambients
- On the computational completeness of context-free parallel communicating grammar systems
- Petri net algorithms in the theory of matrix grammars
- The chemical abstract machine
Cited in
(only showing first 100 items - show all)- Membrane computing with transport and embedded proteins
- LMNtal as a hierarchical logic programming language
- A software tool for verification of spiking neural P systems
- On three variants of rewriting P systems
- Gemmating P systems: Collapsing hierarchies.
- Tissue P systems.
- Aqueous computing: A survey with an invitation to participate.
- Solving the N-queens problem using dP systems with active membranes
- Predictors for flat membrane systems
- Small asynchronous P systems with inhibitors defining non-semilinear sets
- Reaching efficiency through collaboration in membrane systems: dissolution, polarization and cooperation
- Other buds in membrane computing
- Aggregating parallel multiset rewriting systems
- A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows
- The computational complexity of tissue P systems with evolutional symport/antiport rules
- Research on P system with chain structure and application and simulation in arithmetic operation
- Generalized contexts for reaction systems: definition and study of dynamic causalities
- Biocomputing: an insight from linguistics
- Designing a new software tool for digital imagery based on P systems
- Using enzymatic numerical P systems for modeling mobile robot controllers
- A uniform solution to the independent set problem through tissue P systems with cell separation
- Languages generated by P systems with active membranes
- 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
- On membrane hierarchy in P systems
- Rewriting P systems: improved hierarchies
- Topics in the theory of DNA computing.
- A guide to membrane computing.
- 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
- Using membrane computing for effective homology
- 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
- 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
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- Spiking neural P systems with structural plasticity and anti-spikes
- 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
- 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
- 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
This page was built for publication: Computing with membranes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582013)
