The following pages link to Computing with membranes (Q1582013):
Displaying 50 items.
- Universality in Molecular and Cellular Computing (Q3195684) (← links)
- P Systems with Parallel Rewriting for Chain Code Picture Languages (Q3195691) (← links)
- Decidability of Termination Problems for Sequential P Systems with Active Membranes (Q3195702) (← links)
- P SYSTEMS WITH REACTION MAPS (Q3379512) (← links)
- COMPLEXITY OF BIO-COMPUTATION: SYMBOLIC DYNAMICS IN MEMBRANE SYSTEMS (Q3379518) (← links)
- GANDY'S PRINCIPLES FOR MECHANISMS AND MEMBRANE COMPUTING (Q3379519) (← links)
- PARTIAL HALTING IN <font>P</font> SYSTEMS (Q3401468) (← links)
- MEMBRANE ALGORITHM WITH BROWNIAN SUBALGORITHM AND GENETIC SUBALGORITHM (Q3401484) (← links)
- Membrane division, restricted membrane creation and object complexity in P systems (Q3427658) (← links)
- Symbolic generation and representation of complex oscillations (Q3427659) (← links)
- P colonies and prescribed teams (Q3427660) (← links)
- Computational efficiency of dissolution rules in membrane systems (Q3427661) (← links)
- Complexity classes for membrane systems (Q3431433) (← links)
- Tissue Systems and Petri Net Synthesis (Q3452477) (← links)
- From P Colonies to 2D P Colonies and Simulations of Multiagent Systems (Q3454881) (← links)
- P Systems with Toxic Objects (Q3454885) (← links)
- The Abilities of P Colony Based Models in Robot Control (Q3454889) (← links)
- Probabilistic Guarded P Systems, A New Formal Modelling Framework (Q3454890) (← links)
- Polymorphic P Systems with Non-cooperative Rules and No Ingredients (Q3454896) (← links)
- P Automata: Membrane Systems as Acceptors (Q3507428) (← links)
- On the Computational Power of Enhanced Mobile Membranes (Q3507447) (← links)
- Computing with cells: membrane systems – some complexity issues (Q3532791) (← links)
- TISSUE-LIKE <font>P</font> SYSTEMS WITH DYNAMICALLY EMERGING REQUESTS (Q3538859) (← links)
- ON STATELESS AUTOMATA AND P SYSTEMS (Q3542882) (← links)
- A Biologically Inspired Model with Fusion and Clonation of Membranes (Q3543334) (← links)
- The Expressiveness of Concentration Controlled P Systems (Q3543336) (← links)
- Automata on Multisets of Communicating Objects (Q3543347) (← links)
- On Stateless Multicounter Machines (Q3576050) (← links)
- An Approach to the Engineering of Cellular Models Based on P Systems (Q3576075) (← links)
- On Bounded Symport/Antiport P Systems (Q3618684) (← links)
- Analysis and Simulation of Dynamics in Probabilistic P Systems (Q3618691) (← links)
- Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules (Q3630028) (← links)
- MODULAR ASSEMBLY OF CELL SYSTEMS BIOLOGY MODELS USING<font>P</font>SYSTEMS (Q3636155) (← links)
- On Stateless Multihead Finite Automata and Multihead Pushdown Automata (Q3637229) (← links)
- Simple, Enhanced and Mutual Mobile Membranes (Q3642951) (← links)
- Accepting Networks of Non-inserting Evolutionary Processors (Q3642956) (← links)
- Efficient computation in rational-valued P systems (Q3655759) (← links)
- (Tissue) P systems with cell polarity (Q3655760) (← links)
- The computational power of timed P systems with active membranes using promoters (Q4629265) (← links)
- AN APPROACH TO MEMBRANE COMPUTING UNDER INEXACTITUDE (Q4652793) (← links)
- (Q4737675) (← links)
- Contextual array P systems (Q4828663) (← links)
- ON SMALL UNIVERSAL SPLICING SYSTEMS (Q4923288) (← links)
- A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM (Q4923294) (← links)
- A Framework for Complexity Classes in Membrane Computing (Q4982070) (← links)
- Small Universal Numerical P Systems with Thresholds for Computing Functions (Q4988934) (← links)
- (Q5016353) (← links)
- Time-free Solution to Independent Set Problem using P Systems with Active Membranes (Q5025043) (← links)
- A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time (Q5059324) (← links)
- An Overview of 2D Picture Array Generating Models Based on Membrane Computing (Q5112179) (← links)
