Tight bounds for active self-assembly using an insertion primitive

DOI10.1007/978-3-662-44777-2_56MaRDI QIDQ6826725zbMATH OpenFDO

Authors Caleb Malchik, Andrew Winslow

Publication date 8 October 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

DNA computingcontext-free grammarsformal languagespolymers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

This page was built for publication: Tight bounds for active self-assembly using an insertion primitive

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826725)