Using DNA to solve the bounded Post correspondence problem
From MaRDI portal
Publication:1575917
DOI10.1016/S0304-3975(99)00100-0zbMath0951.68039DBLPjournals/tcs/KariGY00WikidataQ55895564 ScholiaQ55895564MaRDI QIDQ1575917
Greg Gloor, Lila Kari, Sheng Yu
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (3)
Cyclic DNA codes over the ring \(\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2+v^2\mathbb {F}_2+uv^2\mathbb {F}_2\) ⋮ Is DNA computing viable for 3-SAT problems? ⋮ Frontier between decidability and undecidability: A survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Contextual insertions/deletions and computability
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- DNA computing based on splicing: The existence of universal computers
- DNA computing: Arrival of biological mathematics
- On the Computational Complexity of Program Scheme Equivalence
- On the power of the splicing operation1
- On the computational power of DNA
This page was built for publication: Using DNA to solve the bounded Post correspondence problem
