Pages that link to "Item:Q1872776"
From MaRDI portal
The following pages link to Membrane computing. An introduction. (Q1872776):
Displaying 50 items.
- Generating and accepting P systems with minimal left and right insertion and deletion (Q256963) (← links)
- Flat maximal parallelism in P systems with promoters (Q264535) (← links)
- Investigating dynamic causalities in reaction systems (Q264548) (← links)
- Modeling membrane systems using colored stochastic Petri nets (Q269787) (← links)
- Modelling DNA and RNA secondary structures using matrix insertion-deletion systems (Q285429) (← links)
- An efficient time-free solution to SAT problem by P systems with proteins on membranes (Q295645) (← links)
- P system implementation of dynamic programming stereo (Q385332) (← links)
- Universality of sequential spiking neural P systems based on minimum spike number (Q391185) (← links)
- Similarity in languages and programs (Q391201) (← links)
- Compositional semantics and behavioural equivalences for reaction systems with restriction (Q403001) (← links)
- Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem (Q403007) (← links)
- Asynchronous P systems with active membranes (Q418762) (← links)
- Localities in systems with a/sync communication (Q418785) (← links)
- Towards bridging two cell-inspired models: P systems and R systems (Q418800) (← links)
- An infinite hierarchy of languages defined by dP systems (Q418824) (← links)
- Simulation techniques for the calculus of wrapped compartments (Q418836) (← links)
- Typed stochastic semantics for the calculus of looping sequences (Q418845) (← links)
- Properties of enhanced mobile membranes via coloured Petri nets (Q437686) (← links)
- Catalytic and communicating Petri nets are Turing complete (Q476166) (← links)
- Computational efficiency and universality of timed P systems with active membranes (Q487991) (← links)
- Verification of membrane systems with delays via Petri nets with delays (Q496035) (← links)
- Contextual array grammars and array P systems (Q499706) (← links)
- Computational power of tissue P systems for generating control languages (Q506719) (← links)
- On languages generated by spiking neural P systems with weights (Q506742) (← links)
- On the computational power of networks of polarized evolutionary processors (Q515676) (← links)
- Computational efficiency and universality of timed P systems with membrane creation (Q521731) (← links)
- Numerical P systems with production thresholds (Q524281) (← links)
- Efficiently solving the bin packing problem through bio-inspired mobility (Q530219) (← links)
- On the computational complexity of membrane systems (Q596128) (← links)
- On generalized communicating P systems with minimal interaction rules (Q616499) (← links)
- P systems with minimal insertion and deletion (Q616500) (← links)
- A \(P\) system model with pure context-free rules for picture array generation (Q630739) (← links)
- A weakly universal spiking neural P system (Q630746) (← links)
- P systems and computational algebraic topology (Q630756) (← links)
- Minimization strategies for maximally parallel multiset rewriting systems (Q633694) (← links)
- Information systems in modeling interactive computations on granules (Q642541) (← links)
- Spatial calculus of looping sequences (Q652132) (← links)
- P automata revisited (Q714827) (← links)
- Interactive information systems: toward perception based computing (Q714829) (← links)
- Accepting networks of genetic processors are computationally complete (Q714860) (← links)
- Matrix insertion-deletion systems (Q714867) (← links)
- Probabilistic model checking of biological systems with uncertain kinetic rates (Q764350) (← links)
- P systems without multiplicities of symbol-objects (Q845847) (← links)
- Non-confluence in divisionless P systems with active membranes (Q847664) (← links)
- Membrane computing and complexity theory: A characterization of PSPACE (Q859989) (← links)
- Deterministic catalytic systems are not universal (Q860859) (← links)
- Quorum sensing P systems (Q870251) (← links)
- A uniform solution to SAT using membrane creation (Q870255) (← links)
- Universality results for P systems based on brane calculi operations (Q870259) (← links)
- Using well-structured transition systems to decide divergence for catalytic P systems (Q872196) (← links)
