Steffen Kopecki

According to our database, Steffen Kopecki authored at least 28 papers between 2009 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On the binary digits of <i>n</i> and <i>n</i>².

Karam Aloui, Damien Jamet, Hajime Kaneko, Steffen Kopecki, Pierre Popoli, Thomas Stoll

Theor. Comput. Sci., 2023

2018

Transducer descriptions of DNA code properties and undecidability of antimorphic problems.

Lila Kari, Stavros Konstantinidis, Steffen Kopecki

Inf. Comput., 2018

Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers.

Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Meng Yang

Algorithms, 2018

2017

On the overlap assembly of strings and languages.

Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki

Nat. Comput., 2017

Deciding whether a regular language is generated by a splicing system.

Lila Kari, Steffen Kopecki

J. Comput. Syst. Sci., 2017

Further remarks on DNA overlap assembly.

Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki

Inf. Comput., 2017

Binary Pattern Tile Set Synthesis Is NP-Hard.

Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki

Algorithmica, 2017

2016

Preface.

Oscar H. Ibarra, Lila Kari, Steffen Kopecki

Nat. Comput., 2016

Additive methods for genomic signatures.

Rallis Karamichalis, Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Stephen Solis-Reyes

BMC Bioinform., 2016

2015

3-color bounded patterned self-assembly.

Lila Kari, Steffen Kopecki, Shinnosuke Seki

Nat. Comput., 2015

A Formal Language Model of DNA Polymerase Enzymatic Activity.

Srujan Kumar Enaganti, Lila Kari, Steffen Kopecki

Fundam. Informaticae, 2015

An investigation into inter- and intragenomic variations of graphic genomic signatures.

Rallis Karamichalis, Lila Kari, Stavros Konstantinidis, Steffen Kopecki

BMC Bioinform., 2015

Methods for Relativizing Properties of Codes.

Helmut Jürgensen, Lila Kari, Steffen Kopecki

Acta Cybern., 2015

2014

On the maximality of languages with combined types of code properties.

Lila Kari, Stavros Konstantinidis, Steffen Kopecki

Theor. Comput. Sci., 2014

Hypergraph Automata: a Theoretical Model for patterned Self-assembly.

Lila Kari, Steffen Kopecki, Amirhossein Simjour

Int. J. Found. Comput. Sci., 2014

An efficient algorithm for computing the edit distance of a regular language via input-altering transducers.

Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Meng Yang

CoRR, 2014

2013

3-Color Bounded Patterned Self-assembly - (Extended Abstract).

Lila Kari, Steffen Kopecki, Shinnosuke Seki

Proceedings of the DNA Computing and Molecular Programming - 19th International Conference, 2013

2012

Language theoretical properties of hairpin formations.

Volker Diekert, Steffen Kopecki

Theor. Comput. Sci., 2012

Deciding regularity of hairpin completions of regular languages in polynomial time.

Volker Diekert, Steffen Kopecki, Victor Mitrana

Inf. Comput., 2012

Iterated Hairpin Completions of Non-crossing Words.

Lila Kari, Steffen Kopecki, Shinnosuke Seki

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

2011

Formal language theory of hairpin formations.

Steffen Kopecki

PhD thesis, 2011

On iterated hairpin completion.

Steffen Kopecki

Theor. Comput. Sci., 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 the Regularity of Iterated Hairpin Completion of a Single Word.

Lila Kari, Shinnosuke Seki, Steffen Kopecki

Fundam. Informaticae, 2011

Deciding if a Regular Language is Generated by a Splicing System

Lila Kari, Steffen Kopecki

CoRR, 2011

Formalsprachliche Theorie der Haarnadelstrukturen.

Steffen Kopecki

Proceedings of the Ausgezeichnete Informatikdissertationen 2011, 2011

2010

Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract).

Volker Diekert, Steffen Kopecki

Proceedings of the Implementation and Application of Automata, 2010

2009

On the Hairpin Completion of Regular Languages.

Volker Diekert, Steffen Kopecki, Victor Mitrana

Proceedings of the Theoretical Aspects of Computing, 2009