Equivalence in Template-Guided Recombination [chapter]

Michael Domaratzki
DNA Computing  
We consider theoretical properties of the template-guided recombination operation. In particular, we consider the decidability of whether two sets of templates are equivalent, that is, whether their action is the same for all operands. We give a language-theoretic characterization of equivalence which leads to decidability results for common language classes. In particular, we show a positive answer for regular sets of templates. For context-free sets of templates, the answer is negative.
doi:10.1007/978-3-540-77962-9_28 dblp:conf/dna/Domaratzki07 fatcat:q5mxbrcetfculoqxkcfwnie3ti