Computing with membranes
From MaRDI portal
Publication:1582013
DOI10.1006/JCSS.1999.1693zbMATH Open0956.68055OpenAlexW2158708642MaRDI QIDQ1582013FDOQ1582013
Authors: Gheorghe Păun 
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)
- Membrane computing and brane calculi. Old, new, and future bridges
- A sublinear Sudoku solution in cP systems and its formal verification
- Fundamentals of Computation Theory
- Rewriting P systems: improved hierarchies
- Hybrid functional Petri nets as MP systems
- Experimental efficiency of programmed mutagenesis
- Triangular array token Petri net and P system
- A universal framework for analysis of self-replication phenomena
- Non-confluence in divisionless P systems with active membranes
- Trading polarizations for labels in P systems with active membranes
- A polynomial alternative to unbounded environment for tissue P systems with cell division
- 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
- Solving a PSPACE-complete problem with cP systems
- Cycles and communicating classes in membrane systems and molecular dynamics
- Deterministic catalytic systems are not universal
- Generalized forbidding matrix grammars and their membrane computing perspective
- Symbolic generation and representation of complex oscillations
- Discrete solutions to differential equations by metabolic P systems
- Three ``quantum algorithms to solve 3-SAT
- The metabolic algorithm for P systems: principles and applications
- Computing with membranes: One more collapsing hierarchy
- An implementation of membrane computing using reconfigurable hardware
- Formal verification of cP systems using Coq
- Computing by floating strings
- Membrane computing and brane calculi (some personal notes)
- Membrane systems with marked membranes
- P systems with energy accounting∗
- PROBABILISTIC REWRITING P SYSTEMS
- A path to computational efficiency through membrane computing
- An efficient labelled nested multiset unification algorithm
- P Automata: Membrane Systems as Acceptors
- Minimal probabilistic P systems for modelling ecological systems
- A software tool for verification of spiking neural P systems
- Solving the subset-problem by P systems with active membrans
- Networks of reaction systems
- Universality in Molecular and Cellular Computing
- Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems
- Computing with cells: membrane systems – some complexity issues
- Fundamental results for learning deterministic extended finite state machines from queries
- Complexity classes for membrane systems
- An Artificial Chemistry for Networking
- A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time
- Relational state transition dynamics
- Hilbert words as arrays generated with P systems
- Title not available (Why is that?)
- A \(\Sigma_2^{\mathrm P} \cup \Pi_2^{\mathrm P}\) lower bound using mobile membranes
- Generating context-free languages using spiking neural P systems with structural plasticity
- Membrane Computing in Connex Environment
- COMPLEXITY OF BIO-COMPUTATION: SYMBOLIC DYNAMICS IN MEMBRANE SYSTEMS
- P SYSTEMS WITH REACTION MAPS
- Maximally parallel contextual string rewriting
- Analysis and Simulation of Dynamics in Probabilistic P Systems
- Tissue Systems and Petri Net Synthesis
- An algebraic formulation of inverse problems in MP dynamics
- 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
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)
