Steffen Kopecki

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 9

Top Venues

CoRR

Nat. Comput.

BMC Bioinform.

Theor. Comput. Sci.

University of Stuttgart, Germany (PHD)

Education History

University of Stuttgart, Germany

PHD

Publications

Karam Aloui, Damien Jamet, Hajime Kaneko, Steffen Kopecki, Pierre Popoli, Thomas Stoll
. Theor. Comput. Sci. 939 (2023)
Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Meng Yang
Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers. Algorithms 11 (11) (2018)
Lila Kari, Stavros Konstantinidis, Steffen Kopecki
Transducer descriptions of DNA code properties and undecidability of antimorphic problems. Inf. Comput. 259 (2) (2018)
Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki
Binary Pattern Tile Set Synthesis Is NP-Hard. Algorithmica 78 (1) (2017)
Lila Kari, Steffen Kopecki
Deciding whether a regular language is generated by a splicing system. J. Comput. Syst. Sci. 84 (2017)
Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki
On the overlap assembly of strings and languages. Nat. Comput. 16 (1) (2017)
Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki
Further remarks on DNA overlap assembly. Inf. Comput. 253 (2017)
Rallis Karamichalis, Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Stephen Solis-Reyes
Additive methods for genomic signatures. BMC Bioinform. 17 (2016)
Oscar H. Ibarra, Lila Kari, Steffen Kopecki
Preface. Nat. Comput. 15 (1) (2016)
Lila Kari, Stavros Konstantinidis, Steffen Kopecki
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems. CoRR (2015)
Srujan Kumar Enaganti, Lila Kari, Steffen Kopecki
A Formal Language Model of DNA Polymerase Enzymatic Activity. Fundam. Informaticae 138 (1-2) (2015)
Lila Kari, Steffen Kopecki, Shinnosuke Seki
3-color bounded patterned self-assembly. Nat. Comput. 14 (2) (2015)
Lila Kari, Stavros Konstantinidis, Steffen Kopecki
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems. DCFS (2015)
Rallis Karamichalis, Lila Kari, Stavros Konstantinidis, Steffen Kopecki
An investigation into inter- and intragenomic variations of graphic genomic signatures. BMC Bioinform. 16 (2015)
Helmut Jürgensen, Lila Kari, Steffen Kopecki
Methods for Relativizing Properties of Codes. Acta Cybern. 22 (2) (2015)
Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki
Binary Pattern Tile Set Synthesis Is NP-hard. ICALP (1) (2015)
Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki
Binary pattern tile set synthesis is NP-hard. CoRR (2014)
Lila Kari, Steffen Kopecki, Amirhossein Simjour
Hypergraph Automata: a Theoretical Model for patterned Self-assembly. Int. J. Found. Comput. Sci. 25 (4) (2014)
Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Meng Yang
An efficient algorithm for computing the edit distance of a regular language via input-altering transducers. CoRR (2014)
Lila Kari, Stavros Konstantinidis, Steffen Kopecki
On the maximality of languages with combined types of code properties. Theor. Comput. Sci. 550 (2014)
Lila Kari, Steffen Kopecki, Shinnosuke Seki
3-color Bounded Patterned Self-assembly. CoRR (2013)
Lila Kari, Steffen Kopecki, Amirhossein Simjour
Hypergraph Automata: A Theoretical Model for Patterned Self-assembly CoRR (2013)
Lila Kari, Steffen Kopecki, Shinnosuke Seki
3-Color Bounded Patterned Self-assembly - (Extended Abstract). DNA (2013)
Lila Kari, Steffen Kopecki, Amirhossein Simjour
Hypergraph Automata: A Theoretical Model for Patterned Self-assembly. UCNC (2013)
Volker Diekert, Steffen Kopecki
Language theoretical properties of hairpin formations. Theor. Comput. Sci. 429 (2012)
Lila Kari, Steffen Kopecki
Deciding Whether a Regular Language Is Generated by a Splicing System. DNA (2012)
Volker Diekert, Steffen Kopecki, Victor Mitrana
Deciding regularity of hairpin completions of regular languages in polynomial time. Inf. Comput. 217 (2012)
Lila Kari, Steffen Kopecki, Shinnosuke Seki
Iterated Hairpin Completions of Non-crossing Words. SOFSEM (2012)
Volker Diekert, Steffen Kopecki
It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular. Int. J. Found. Comput. Sci. 22 (8) (2011)
Lila Kari, Shinnosuke Seki, Steffen Kopecki
On the Regularity of Iterated Hairpin Completion of a Single Word. Fundam. Informaticae 110 (1-4) (2011)
Volker Diekert, Steffen Kopecki, Victor Mitrana
Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time CoRR (2011)
Steffen Kopecki
Formalsprachliche Theorie der Haarnadelstrukturen. Ausgezeichnete Informatikdissertationen (2011)
Volker Diekert, Steffen Kopecki
It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular CoRR (2011)
Lila Kari, Steffen Kopecki
Deciding if a Regular Language is Generated by a Splicing System CoRR (2011)
Lila Kari, Steffen Kopecki, Shinnosuke Seki
Iterated Hairpin Completions of Non-crossing Words CoRR (2011)
Steffen Kopecki
On iterated hairpin completion. Theor. Comput. Sci. 412 (29) (2011)
Lila Kari, Steffen Kopecki, Shinnosuke Seki
On the regularity of iterated hairpin completion of a single word CoRR (2011)
Steffen Kopecki
On the Iterated Hairpin Completion CoRR (2010)
Volker Diekert, Steffen Kopecki
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract). CIAA (2010)
Steffen Kopecki
On the Iterated Hairpin Completion. Developments in Language Theory (2010)
Volker Diekert, Steffen Kopecki, Victor Mitrana
On the Hairpin Completion of Regular Languages. ICTAC (2009)

Steffen Kopecki.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Steffen Kopecki