Pages that link to "Item:Q3092338"
From MaRDI portal
The following pages link to Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems (Q3092338):
Displayed 9 items.
- Modular verification of chemical reaction network encodings via serializability analysis (Q288812) (← links)
- A strand graph semantics for DNA-based computation (Q288814) (← links)
- Stochastic simulation of multiple process calculi for biology (Q418846) (← links)
- Performance limits and trade-offs in entropy-driven biochemical computers (Q1649423) (← links)
- Verifying polymer reaction networks using bisimulation (Q2003997) (← links)
- Formal semantics and verification of network-based biocomputation circuits (Q2234096) (← links)
- An RNA-based theory of natural universal computation (Q2670144) (← links)
- Time Complexity of Computation and Construction in the Chemical Reaction Network-Controlled Tile Assembly Model (Q2835714) (← links)
- Functional Analysis of Large-Scale DNA Strand Displacement Circuits (Q5168509) (← links)