Erratum to ``The computational power of Benenson automata

DOI10.1016/J.TCS.2011.04.044MaRDI QIDQ652156zbMATHOpenAlexWikidataFDO

Authors 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)

Recommendations

• Erratum: ``PRIMES is in P
• Letter to editor
• Corrigendum to: ``On a lemma of Crochemore and Rytter
• Erratum: “Clifford quantum cellular automata: Trivial group in 2D and Witt group in 3D” [J. Math. Phys. 62, 092202 (2021)]
• Correction to: ``Learning nonlinear input-output maps with dissipative quantum systems

Cited in

(6)

• Correction to: ``Current-state opacity formulations in probabilistic finite automata
• Corrigendum to: ``Iterated stack automata and complexity classes
• Corrigendum to: ``On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
• Correction to: ``Computational limitations of affine automata and generalized affine automata
• Correction to: ``Complexity-theoretic aspects of expanding cellular automata
• Erratum to ``Languages not recognizable in real time by one-dimensional cellular automata

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)