Computing with membranes
From MaRDI portal
Publication:1582013
DOI10.1006/JCSS.1999.1693zbMATH Open0956.68055OpenAlexW2158708642MaRDI QIDQ1582013FDOQ1582013
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The chemical abstract machine
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Title not available (Why is that?)
- Mobile ambients
- Title not available (Why is that?)
- On the computational completeness of context-free parallel communicating grammar systems
- Title not available (Why is that?)
- Petri net algorithms in the theory of matrix grammars
- 2-testability and relabelings produce everything
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- On the computational complexity of membrane systems
- A survey of timed automata for the development of real-time systems
- Modeling Ecosystems Using P Systems: The Bearded Vulture, a Case Study
- P systems and computational algebraic topology
- Reaction automata
- Networks of evolutionary processors: computationally complete normal forms
- New solutions for disjoint paths in P systems
- Computing with viruses
- Flat maximal parallelism in P systems with promoters
- Investigating dynamic causalities in reaction systems
- Modelling and verification of weighted spiking neural systems
- Small (purely) catalytic P systems simulating register machines
- Membrane computing and complexity theory: A characterization of PSPACE
- (Mem)brane automata
- Membrane systems with proteins embedded in membranes
- Membrane computing with transport and embedded proteins
- On Some Classes of Sequential Spiking Neural P Systems
- Spiking Neural P Systems with Thresholds
- ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
- On languages generated by spiking neural P systems with weights
- Enhanced mobile membranes: computability results
- Spatial P systems
- Modeling membrane systems using colored stochastic Petri nets
- A uniform solution to SAT using membrane creation
- The power of communication: P systems with symport/antiport
- Asynchronous P systems with active membranes
- Modeling dependencies and simultaneity in membrane system computations
- Towards bridging two cell-inspired models: P systems and R systems
- A uniform family of tissue P systems with cell division solving 3-COL in a linear time
- P systems with symport/antiport simulating counter automata
- A Hybrid Approach to Modeling Biological Systems
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
- A Formal Framework for Static (Tissue) P Systems
- On the Reachability Problem in P Systems with Mobile Membranes
- The Calculus of Looping Sequences for Modeling Biological Membranes
- A quick introduction to membrane computing
- A guide to membrane computing.
- P systems with minimal parallelism
- On the verification of membrane systems with dynamic structure
- Minimization strategies for maximally parallel multiset rewriting systems
- Spatial calculus of looping sequences
- Computational complexity of tissue-like P systems
- Spiking neural P systems: main ideas and results
- Deterministic and stochastic P systems for modelling cellular processes
- Seeking computational efficiency boundaries: the Păun's conjecture
- Using well-structured transition systems to decide divergence for catalytic P systems
- Emergence of random selections in evolution of biological populations
- Solving the N-queens problem using dP systems with active membranes
- Tissue P systems.
- Cell-like P-systems based on rules of particle swarm optimization
- An efficient time-free solution to SAT problem by P systems with proteins on membranes
- Computational efficiency and universality of timed P systems with active membranes
- Computational efficiency and universality of timed P systems with membrane creation
- Computationally universal P systems without priorities: Two catalysts are sufficient
- Catalytic P systems, semilinear sets, and vector addition systems
- Multiset random context grammars, checkers, and transducers
- The conformon-P system: a molecular and cell biology-inspired computability model
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes
- Cell-like spiking neural P systems with evolution rules
- Small universal simple spiking neural P systems with weights
- Solving HPP and SAT by P systems with active membranes and separation rules
- Simulation of spatial P system models
- Fuzzy reasoning spiking neural P system for fault diagnosis
- Formal verification of cP systems using PAT3 and ProB
- P transducers
- Cell communication in tissue \(P\) systems: universality results
- Time-Free Spiking Neural P Systems
- 3-Col problem modelling using simple kernel P systems
- Spiking Neural P Systems with Weights
- A linear-time tissue P system based solution for the 3-coloring problem
- Describing the immune system using enhanced mobile membranes
- Psim: A Computational Platform for Metabolic P Systems
- Timed P Automata
- A Petri net model for membrane systems with dynamic structure
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- MGS: a rule-based programming language for complex objects and collections
- Solving Numerical NP-Complete Problems with Spiking Neural P Systems
- P Systems with Active Membranes Operating under Minimal Parallelism
- LMNtal as a hierarchical logic programming language
- P Systems with Toxic Objects
- A P-Lingua based simulator for tissue P systems
- An overview of the K semantic framework
- Towards “Fypercomputations” (in Membrane Computing)
- Simple, Enhanced and Mutual Mobile Membranes
- Time-free solution to SAT problem using P systems with active membranes
- PARTIAL HALTING IN P SYSTEMS
- ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
- P system implementation of dynamic programming stereo
- Solving 3-SAT in distributed P systems with string objects
- Dendrite P systems
- A Turing machine simulation by P systems without charges
- A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators
- Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion
- Computing with SN P systems with I/O mode
- A survey of results on evolution-communication P systems with energy
- Description of membrane systems with time Petri nets: promoters/inhibitors, membrane dissolution, and priorities
- Division rules for tissue P systems inspired by space filling curves
- From P systems to morphogenetic systems: an overview and open problems
- Generating pictures in string representation with P systems: the case of space-filling curves
- How derivation modes and halting conditions may influence the computational power of P systems
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)
