Steffen Kopecki

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