6 citations · 9 across the 11 of their papers we have counts for
5 papers · 1 filter
Deciding Whether a Regular Language is Generated by a Splicing System
Lila Kari, Steffen Kopecki
Splicing as a binary word/language operation is inspired by the DNA recombination under the action of restriction enzymes and ligases, and was first introduced by Tom Head in 1987.…
Iterated Hairpin Completions of Non-crossing Words
Lila Kari, Steffen Kopecki, Shinnosuke Seki
Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or more precis…
Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time
Volker Diekert, Steffen Kopecki, Victor Mitrana
The hairpin completion is an operation on formal languages that has been inspired by the hairpin formation in DNA biochemistry and by DNA computing. In this paper we investigate th…
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{…
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…