39 citations · 116 across the 19 of their papers we have counts for
3 papers · 1 filter
Binary pattern tile set synthesis is NP-hard
Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier +2
In the field of algorithmic self-assembly, a long-standing unproven conjecture has been that of the NP-hardness of binary pattern tile set synthesis (2-PATS). The -PATS problem…
3-color Bounded Patterned Self-assembly
Lila Kari, Steffen Kopecki, Shinnosuke Seki
Patterned self-assembly tile set synthesis PATS is the problem of finding a minimal tile set which uniquely self-assembles into a given pattern. Czeizler and Popa proved the NP-com…
Properties of Pseudo-Primitive Words and their Applications
Lila Kari, Benoît Masson, Shinnosuke Seki
A pseudo-primitive word with respect to an antimorphic involution θis a word which cannot be written as a catenation of occurrences of a strictly shorter word t and θ(t). Propertie…