Titlebook: DNA Computing and Molecular Programming; 20th International C Satoshi Murata,Satoshi Kobayashi Conference proceedings 2014 Springer Interna

受人支配

Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation,nondeterministic cellular automaton augmented with rigid-body movement rules (push/pull, deterministically and programmatically applied to specific monomers) and random agitations (nondeterministically applied to every monomer and direction with equal probability all of the time). Previous work on n

CORE

The Computational Capability of Chemical Reaction Automata, CRAs in maximally parallel manner are computationally equivalent to Turing machines, while the computational power of CRAs in sequential manner coincides with that of the class of Petri nets, which is in marked contrast to the result that RAs (in both maximally parallel and sequential manners) have

Anticoagulant

墊子

欲望

BALK

含糊其辭

信任

On Decidability and Closure Properties of Language Classes with Respect to Bio-operations,ired operations. We use these results to prove new decidability results and closure properties of some classes of languages under hairpin-inversion, pseudo-inversion, and other bio-operations. We also provide a new approach for proving the undecidability of problems involving bio-operations for whic

展覽

atrophy