Computing with membranes
From MaRDI portal
Publication:1582013
DOI10.1006/jcss.1999.1693zbMath0956.68055OpenAlexW2158708642MaRDI QIDQ1582013
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (only showing first 100 items - show all)
Small (purely) catalytic P systems simulating register machines ⋮ Flat maximal parallelism in P systems with promoters ⋮ Modelling and verification of weighted spiking neural systems ⋮ Investigating dynamic causalities in reaction systems ⋮ Computing with viruses ⋮ Modeling membrane systems using colored stochastic Petri nets ⋮ A sublinear Sudoku solution in cP systems and its formal verification ⋮ 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 ⋮ A universal framework for analysis of self-replication phenomena ⋮ Non-confluence in divisionless P systems with active membranes ⋮ Solving the N-queens problem using dP systems with active membranes ⋮ Predictors for flat membrane systems ⋮ Membrane computing and complexity theory: A characterization of PSPACE ⋮ Deterministic catalytic systems are not universal ⋮ A uniform solution to SAT using membrane creation ⋮ Universality results for P systems based on brane calculi operations ⋮ On the computational complexity of membrane systems ⋮ Using well-structured transition systems to decide divergence for catalytic P systems ⋮ Multiset random context grammars, checkers, and transducers ⋮ On small universal antiport P systems ⋮ Discrete solutions to differential equations by metabolic P systems ⋮ Three ``quantum algorithms to solve 3-SAT ⋮ Cycles and communicating classes in membrane systems and molecular dynamics ⋮ Automata and processes on multisets of communicating objects ⋮ On the verification of membrane systems with dynamic structure ⋮ P system implementation of dynamic programming stereo ⋮ P systems with minimal parallelism ⋮ Small asynchronous P systems with inhibitors defining non-semilinear sets ⋮ Reaching efficiency through collaboration in membrane systems: dissolution, polarization and cooperation ⋮ A survey of timed automata for the development of real-time systems ⋮ Minimal probabilistic P systems for modelling ecological systems ⋮ On three variants of rewriting P systems ⋮ Gemmating P systems: Collapsing hierarchies. ⋮ Tissue P systems. ⋮ Asynchronous P systems with active membranes ⋮ Reaction automata ⋮ Towards bridging two cell-inspired models: P systems and R systems ⋮ Modeling dependencies and simultaneity in membrane system computations ⋮ P systems and computational algebraic topology ⋮ Minimization strategies for maximally parallel multiset rewriting systems ⋮ A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows ⋮ A linear time complexity of breadth-first search using P system with membrane division ⋮ Spatial calculus of looping sequences ⋮ 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 ⋮ A limitation of cell division in tissue P systems by PSPACE ⋮ Relational state transition dynamics ⋮ A new approach to fault diagnosis of power systems using fuzzy reasoning spiking neural P systems ⋮ Aqueous computing: A survey with an invitation to participate. ⋮ Computational efficiency and universality of timed P systems with active membranes ⋮ Computing with membranes and picture arrays ⋮ Contextual array grammars and array P systems ⋮ Computational power of tissue P systems for generating control languages ⋮ On languages generated by spiking neural P systems with weights ⋮ Generalized contexts for reaction systems: definition and study of dynamic causalities ⋮ Weight optimization for case-based reasoning using membrane computing ⋮ Membrane computing and brane calculi. Old, new, and future bridges ⋮ Membrane systems with proteins embedded in membranes ⋮ Decision problems in membrane systems with peripheral proteins, transport and evolution ⋮ (Mem)brane automata ⋮ A uniform family of tissue P systems with cell division solving 3-COL in a linear time ⋮ Processes of membrane systems with promoters and inhibitors ⋮ The metabolic algorithm for P systems: principles and applications ⋮ Generalized communicating P systems ⋮ Computational efficiency and universality of timed P systems with membrane creation ⋮ A toolbox for simpler active membrane algorithms ⋮ An unsupervised learning algorithm for membrane computing ⋮ 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 ⋮ On aggregation in multiset-based self-assembly of graphs ⋮ Spatial P systems ⋮ An empirical evaluation of P system testing techniques ⋮ P systems with active membranes: Trading time for space ⋮ Complexity-preserving simulations among three variants of accepting networks of evolutionary processors ⋮ Enhanced mobile membranes: computability results ⋮ A uniform solution to the independent set problem through tissue P systems with cell separation ⋮ Languages generated by P systems with active membranes ⋮ Hybrid functional Petri nets as MP systems ⋮ Models of molecular computing based on molecular reactions ⋮ The power of communication: P systems with symport/antiport ⋮ Experimental efficiency of programmed mutagenesis ⋮ Tissue P systems with cell separation: attacking the partition problem ⋮ Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources ⋮ Trading polarizations for labels in P systems with active membranes ⋮ P systems with symport/antiport simulating counter automata ⋮ Computational complexity of tissue-like P systems ⋮ On the power of enzymatic numerical P systems ⋮ A quick introduction to membrane computing ⋮ Simulating a P system based efficient solution to SAT by using GPUs ⋮ P systems with control nuclei: the concept ⋮ Test generation from P systems using model checking ⋮ A P-Lingua based simulator for tissue P systems ⋮ An overview of the K semantic framework ⋮ Membrane computing with transport and embedded proteins ⋮ LMNtal as a hierarchical logic programming language ⋮ A software tool for verification of spiking neural P systems ⋮ Networks of evolutionary processors: computationally complete normal forms ⋮ New solutions for disjoint paths in P systems
Cites Work
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- The chemical abstract machine
- 2-testability and relabelings produce everything
- On the computational completeness of context-free parallel communicating grammar systems
- Petri net algorithms in the theory of matrix grammars
- Mobile ambients
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing with membranes