3 papers
cs.DM2013
Hypergraph Automata: A Theoretical Model for Patterned Self-assembly
Lila Kari, Steffen Kopecki, Amirhossein Simjour
Patterned self-assembly is a process whereby coloured tiles self-assemble to build a rectangular coloured pattern. We propose self-assembly (SA) hypergraph automata as an automata-…
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…