Using DNA to solve the bounded Post correspondence problem
type: Item
instance of: scholarly article
title: Using DNA to solve the bounded Post correspondence problem
zbMATH Open document ID: 0951.68039
DOI: 10.1016/S0304-3975(99)00100-0
author: Greg Gloor
author: Lila Kari
author: Sheng Yu
published in: Theoretical Computer Science
publication date: 2000-08-23T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1495197
zbMATH Keywords: DNA computing
Wikidata QID: Q55895564
MaRDI profile type: Publication
cites work: Q4224899
cites work: Q4224884
cites work: On the computational power of DNA
cites work: On the Computational Complexity of Program Scheme Equivalence
cites work: Q4224915
cites work: DNA computing based on splicing: The existence of universal computers
cites work: Q4198056
cites work: Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
cites work: Q5592246
cites work: Q4224886
cites work: Q4224889
cites work: DNA computing: Arrival of biological mathematics
cites work: Contextual insertions/deletions and computability
cites work: Q4263694
cites work: Q4224882
cites work: Q4224896
cites work: Q4224919
cites work: On the power of the splicing operation1
cites work: Q4888094
cites work: Q4224876
cites work: Q5678435
cites work: Q4224911
cites work: Q4263695
cites work: Q4224903
DBLP publication ID: journals/tcs/KariGY00
description: scientific article; zbMATH DE number 1495197