Recommendations
Cites work
- 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?)
- 2-testability and relabelings produce everything
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- 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)- Relational state transition dynamics
- An algebraic formulation of inverse problems in MP dynamics
- Fundamentals of Computation Theory
- Hilbert words as arrays generated with P systems
- Membrane computing and brane calculi. Old, new, and future bridges
- P systems with energy accounting∗
- A software tool for verification of spiking neural P systems
- Universality in Molecular and Cellular Computing
- The metabolic algorithm for P systems: principles and applications
- P systems with control nuclei: the concept
- Simulating a P system based efficient solution to SAT by using GPUs
- Test generation from P systems using model checking
- An Artificial Chemistry for Networking
- COMPLEXITY OF BIO-COMPUTATION: SYMBOLIC DYNAMICS IN MEMBRANE SYSTEMS
- P SYSTEMS WITH REACTION MAPS
- Generating context-free languages using spiking neural P systems with structural plasticity
- A sublinear Sudoku solution in cP systems and its formal verification
- Generalized forbidding matrix grammars and their membrane computing perspective
- Solving the subset-problem by P systems with active membrans
- Rewriting P systems: improved hierarchies
- Networks of reaction systems
- PROBABILISTIC REWRITING P SYSTEMS
- Computing by floating strings
- Membrane computing and brane calculi (some personal notes)
- Membrane systems with marked membranes
- Discrete solutions to differential equations by metabolic P systems
- Three ``quantum algorithms to solve 3-SAT
- Minimal probabilistic P systems for modelling ecological systems
- Deterministic catalytic systems are not universal
- Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems
- Analysis and Simulation of Dynamics in Probabilistic P Systems
- Symbolic generation and representation of complex oscillations
- Membrane Computing in Connex Environment
- Maximally parallel contextual string rewriting
- Hybrid functional Petri nets as MP systems
- Triangular array token Petri net and P system
- scientific article; zbMATH DE number 1568811 (Why is no real title available?)
- Tissue Systems and Petri Net Synthesis
- A universal framework for analysis of self-replication phenomena
- Non-confluence in divisionless P systems with active membranes
- Cycles and communicating classes in membrane systems and molecular dynamics
- Experimental efficiency of programmed mutagenesis
- Fundamental results for learning deterministic extended finite state machines from queries
- Computing with cells: membrane systems – some complexity issues
- Computing with membranes: One more collapsing hierarchy
- Trading polarizations for labels in P systems with active membranes
- A polynomial alternative to unbounded environment for tissue P systems with cell division
- A path to computational efficiency through membrane computing
- A \(\Sigma_2^{\mathrm P} \cup \Pi_2^{\mathrm P}\) lower bound using mobile membranes
- A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time
- An implementation of membrane computing using reconfigurable hardware
- Complexity classes for membrane systems
- P Automata: Membrane Systems as Acceptors
- An efficient labelled nested multiset unification algorithm
- Solving a PSPACE-complete problem with cP systems
- Formal verification of cP systems using Coq
- Multiset random context grammars, checkers, and transducers
- The conformon-P system: a molecular and cell biology-inspired computability model
- Enhanced mobile membranes: computability results
- Spatial P systems
- Spiking Neural P Systems with Thresholds
- On the computational complexity of membrane systems
- Modeling membrane systems using colored stochastic Petri nets
- On stateless two-pushdown automata and restarting automata
- The power of communication: P systems with symport/antiport
- Seeking computational efficiency boundaries: the Păun's conjecture
- A survey of timed automata for the development of real-time systems
- Computational complexity of tissue-like P systems
- Describing the immune system using enhanced mobile membranes
- MGS: a rule-based programming language for complex objects and collections
- Time-free solution to SAT problem using P systems with active membranes
- Towards “Fypercomputations” (in Membrane Computing)
- A guide to membrane computing.
- Psim: A Computational Platform for Metabolic P Systems
- Solving Numerical NP-Complete Problems with Spiking Neural P Systems
- Modeling Ecosystems Using P Systems: The Bearded Vulture, a Case Study
- PARTIAL HALTING IN P SYSTEMS
- P systems and computational algebraic topology
- Cell-like spiking neural P systems with evolution rules
- Time-free spiking neural P systems
- Cell communication in tissue \(P\) systems: universality results
- Spiking neural P systems: main ideas and results
- 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
- Computational efficiency and universality of timed P systems with active membranes
- Simple, Enhanced and Mutual Mobile Membranes
- Simulation of spatial P system models
- P systems with active membranes operating under minimal parallelism
- A uniform family of tissue P systems with cell division solving 3-COL in a linear time
- Reaction automata
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- Emergence of random selections in evolution of biological populations
- Timed P Automata
- Small universal simple spiking neural P systems with weights
- Fuzzy reasoning spiking neural P system for fault diagnosis
- Solving the N-queens problem using dP systems with active membranes
- P systems with minimal parallelism
- Solving HPP and SAT by P systems with active membranes and separation rules
- ON VARIOUS NOTIONS OF PARALLELISM IN 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)
