Erratum to ``The computational power of Benenson automata

DOI10.1016/J.TCS.2011.04.044zbMATH Open1230.68138OpenAlexW2033406540WikidataQ59328926 ScholiaQ59328926MaRDI QIDQ652156FDOQ652156

David Soloveichik, Erik Winfree

Publication date: 19 December 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.044

zbMATH Keywords

deterministicBenenson automatanon-deterministic

Mathematics Subject Classification ID

Medical applications (general) (92C50) Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (2)

• Corrigendum to: ``Iterated stack automata and complexity classes
• Corrigendum to: ``On the computing powers of \(\mathcal{L}\)-reductions of insertion languages

This page was built for publication: Erratum to ``The computational power of Benenson automata

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