1 citations · 1 across the 5 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2015★ 1 cited
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems
Lila Kari, Stavros Konstantinidis, Steffen Kopecki
This work concerns formal descriptions of DNA code properties, and builds on previous work on transducer descriptions of classic code properties and on trajectory descriptions of D…
cs.FL2011
On the regularity of iterated hairpin completion of a single word
Lila Kari, Steffen Kopecki, Shinnosuke Seki
Hairpin completion is an abstract operation modeling a DNA bio-operation which receives as input a DNA strand $w = xαy \calpha$, and outputs , where $\bar{…
cs.FL2011
It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular
Volker Diekert, Steffen Kopecki
The hairpin completion is an operation on formal languages which is inspired by the hairpin formation in biochemistry. Hairpin formations occur naturally within DNA-computing. It h…