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
- Solving 3-SAT in distributed P systems with string objects
- Dendrite P systems
- A Turing machine simulation by P systems without charges
- Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion
- Computing with SN P systems with I/O mode
- 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
- Modeling diel vertical migration with membrane computing
- P systems with limited number of objects
- Simulating reversible computation with reaction systems
- Sequential dynamic threshold neural P systems
- Simulating counting oracles with cooperation
- Tissue P systems with promoter simulation with MeCoSim and P-Lingua framework
- The computational power of cell-like P systems with one protein on membrane
- Theory of reaction automata: a survey
- Membrane computing and one-way functions
- 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
- Title not available (Why is that?)
- On the expressiveness of the \(\pi \)-calculus and the mobile ambients
- On the expressiveness of \(\pi\)-calculus for encoding mobile ambients
- Tissue P systems with evolutional communication rules with two objects in the left-hand side
- Breaking DES using P systems.
- Simulating P systems with membrane dissolution in a chemical calculus
- On maximal parallel application of rules in rewriting P systems
- A framework for complexity classes in membrane computing
- From P Colonies to 2D P Colonies and Simulations of Multiagent Systems
- Aqueous computing: A survey with an invitation to participate.
- Mutual exclusion and reversibility in reaction systems
- Biocomputing: an insight from linguistics
- Rule synchronization for tissue P systems
- Predictors for flat membrane systems
- Cell-like P systems with evolutional symport/antiport rules and membrane creation
- A Prolog simulator for deterministic P systems with active membranes
- Hierarchies of parallel rewriting P systems -- a survey
- P systems with local graph productions
- Results on catalytic and evolution-communication P systems
- Generalized contexts for reaction systems: definition and study of dynamic causalities
- P systems with parallel rewriting for chain code picture languages
- Decidability of termination problems for sequential P systems with active membranes
- Two notes on APCol systems
- Transforming communicating X-machines into 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)
