Erratum to ``The computational power of Benenson automata
DOI10.1016/J.TCS.2011.04.044zbMATH Open1230.68138OpenAlexW2033406540WikidataQ59328926 ScholiaQ59328926MaRDI QIDQ652156FDOQ652156
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
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
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 (6)
- Correction to: ``Computational limitations of affine automata and generalized affine automata
- Erratum to ``Languages not recognizable in real time by one-dimensional cellular automata
- Corrigendum to: ``Iterated stack automata and complexity classes
- Correction to: ``Complexity-theoretic aspects of expanding cellular automata
- Correction to: ``Current-state opacity formulations in probabilistic finite automata
- 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)
