Equivalence in Template-Guided Recombination

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.

• Type: Conference
• Year: 2007
• Where: DNA
• Authors: Michael Domaratzki
• Keywords: Common Language Classes, Context-free Sets, DNA 2007, Template-guided Recombination Operation