20 citations · 30 across the 20 of their papers we have counts for
Showing 2011 · cs.FLShow all
3 papers · 2 filters
cs.FL2011
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…
cs.FL2011
Absoluteness of subword inequality is undecidable
Shinnosuke Seki
Mateescu, Salomaa, and Yu asked: is it decidable whether a given subword history assumes only non-negative values for all words over a given alphabet. In this paper, we solve this…
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{…