Two-Party Watson-Crick Computations
From MaRDI portal
Publication:3073638
DOI10.1007/978-3-642-18098-9_21zbMath1297.68148OpenAlexW1519156519MaRDI QIDQ3073638
Andreas Malcher, Martin Kutrib
Publication date: 11 February 2011
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_21
Formal languages and automata (68Q45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Related Items
Cites Work
- 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
- On 5′→3′ Sensing Watson-Crick Finite Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Two-Party Watson-Crick Computations