Two-party Watson-Crick computations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 107774 (Why is no real title available?)
- scientific article; zbMATH DE number 1236223 (Why is no real title available?)
- scientific article; zbMATH DE number 1342112 (Why is no real title available?)
- scientific article; zbMATH DE number 1502112 (Why is no real title available?)
- scientific article; zbMATH DE number 1754655 (Why is no real title available?)
- scientific article; zbMATH DE number 1405691 (Why is no real title available?)
- scientific article; zbMATH DE number 3302285 (Why is no real title available?)
- On 5′→3′ Sensing Watson-Crick Finite Automata
- On the descriptional complexity of Watson-Crick automata
- On the power of parallel communicating Watson-Crick automata systems
- PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
- Reversal-Bounded Multicounter Machines and Their Decision Problems
Cited in
(3)
This page was built for publication: Two-party Watson-Crick computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073638)