On the Hairpin Completion of Regular Languages. - Volker Diekert; Steffen Kopecki; Victor Mitrana (ICTAC, 2009)

Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract). - Volker Diekert; Steffen Kopecki (CIAA, 2010)

Formalsprachliche Theorie der Haarnadelstrukturen. - Steffen Kopecki (Ausgezeichnete Informatikdissertationen, 2011)

Deciding if a Regular Language is Generated by a Splicing System - Lila Kari; Steffen Kopecki (CoRR, 2011)

On the Regularity of Iterated Hairpin Completion of a Single Word. - Lila Kari; Shinnosuke Seki 001; Steffen Kopecki (Fundam. Informaticae, 2011)

It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular. - Volker Diekert; Steffen Kopecki (Int. J. Found. Comput. Sci., 2011)

On iterated hairpin completion. - Steffen Kopecki (Theor. Comput. Sci., 2011)

Formal language theory of hairpin formations. - Steffen Kopecki (2011)

Iterated Hairpin Completions of Non-crossing Words. - Lila Kari; Steffen Kopecki; Shinnosuke Seki 001 (SOFSEM, 2012)

Deciding regularity of hairpin completions of regular languages in polynomial time. - Volker Diekert; Steffen Kopecki; Victor Mitrana (Inf. Comput., 2012)

Language theoretical properties of hairpin formations. - Volker Diekert; Steffen Kopecki (Theor. Comput. Sci., 2012)

3-Color Bounded Patterned Self-assembly - (Extended Abstract). - Lila Kari; Steffen Kopecki; Shinnosuke Seki 001 (DNA, 2013)

An efficient algorithm for computing the edit distance of a regular language via input-altering transducers. - Lila Kari; Stavros Konstantinidis; Steffen Kopecki; Meng Yang 010 (CoRR, 2014)

Hypergraph Automata: a Theoretical Model for patterned Self-assembly. - Lila Kari; Steffen Kopecki; Amirhossein Simjour (Int. J. Found. Comput. Sci., 2014)

On the maximality of languages with combined types of code properties. - Lila Kari; Stavros Konstantinidis; Steffen Kopecki (Theor. Comput. Sci., 2014)

Methods for Relativizing Properties of Codes. - Helmut Jürgensen; Lila Kari; Steffen Kopecki (Acta Cybern., 2015)

An investigation into inter- and intragenomic variations of graphic genomic signatures. - Rallis Karamichalis; Lila Kari; Stavros Konstantinidis; Steffen Kopecki (BMC Bioinform., 2015)

A Formal Language Model of DNA Polymerase Enzymatic Activity. - Srujan Kumar Enaganti; Lila Kari; Steffen Kopecki (Fundam. Informaticae, 2015)

3-color bounded patterned self-assembly. - Lila Kari; Steffen Kopecki; Shinnosuke Seki 001 (Nat. Comput., 2015)

Additive methods for genomic signatures. - Rallis Karamichalis; Lila Kari; Stavros Konstantinidis; Steffen Kopecki; Stephen Solis-Reyes (BMC Bioinform., 2016)

Preface. - Oscar H. Ibarra; Lila Kari; Steffen Kopecki (Nat. Comput., 2016)

Binary Pattern Tile Set Synthesis Is NP-Hard. - Lila Kari; Steffen Kopecki; Pierre-Étienne Meunier; Matthew J. Patitz; Shinnosuke Seki 001 (Algorithmica, 2017)

Further remarks on DNA overlap assembly. - Srujan Kumar Enaganti; Oscar H. Ibarra; Lila Kari; Steffen Kopecki (Inf. Comput., 2017)

Deciding whether a regular language is generated by a splicing system. - Lila Kari; Steffen Kopecki (J. Comput. Syst. Sci., 2017)

On the overlap assembly of strings and languages. - Srujan Kumar Enaganti; Oscar H. Ibarra; Lila Kari; Steffen Kopecki (Nat. Comput., 2017)

Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers. - Lila Kari; Stavros Konstantinidis; Steffen Kopecki; Meng Yang 010 (Algorithms, 2018)

Transducer descriptions of DNA code properties and undecidability of antimorphic problems. - Lila Kari; Stavros Konstantinidis; Steffen Kopecki (Inf. Comput., 2018)

On the binary digits of n and n2. - Karam Aloui; Damien Jamet; Hajime Kaneko; Steffen Kopecki; Pierre Popoli; Thomas Stoll (Theor. Comput. Sci., 2023)