Steffen Kopecki

Available identifiers

zbMath Open kopecki.steffenMaRDI QIDQ340585

List of research outcomes

Publication	Date of Publication	Type
On the binary digits of \(n\) and \(n^2\)	2022-11-17	Paper
On the overlap assembly of strings and languages	2019-07-10	Paper
3-color bounded patterned self-assembly	2019-07-08	Paper
Efficient algorithms for computing the inner edit distance of a regular language via transducers	2019-01-21	Paper
Transducer descriptions of DNA code properties and undecidability of antimorphic problems	2018-03-21	Paper
Binary pattern tile set synthesis is NP-hard	2017-05-11	Paper
Further remarks on DNA overlap assembly	2017-03-16	Paper
Deciding whether a regular language is generated by a splicing system	2016-11-14	Paper
A formal language model of DNA polymerase enzymatic activity	2016-05-11	Paper
Methods for relativizing properties of codes	2016-05-03	Paper
Binary pattern tile set synthesis is NP-hard	2015-10-27	Paper
Transducer descriptions of DNA code properties and undecidability of antimorphic problems	2015-08-07	Paper
Hypergraph automata: a theoretical model for patterned self-assembly	2014-11-14	Paper
On the maximality of languages with combined types of code properties	2014-08-26	Paper
3-Color Bounded Patterned Self-assembly	2014-07-07	Paper
Hypergraph Automata: A Theoretical Model for Patterned Self-assembly	2013-06-28	Paper
Deciding Whether a Regular Language Is Generated by a Splicing System	2012-11-06	Paper
Deciding regularity of hairpin completions of regular languages in polynomial time	2012-10-11	Paper
Iterated Hairpin Completions of Non-crossing Words	2012-06-15	Paper
Language theoretical properties of hairpin formations	2012-05-30	Paper
IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR	2012-03-13	Paper
On the Regularity of Iterated Hairpin Completion of a Single Word	2011-11-22	Paper
On iterated hairpin completion	2011-07-14	Paper
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)	2011-02-11	Paper
On the Iterated Hairpin Completion	2010-08-31	Paper
On the Hairpin Completion of Regular Languages	2009-08-20	Paper

Research outcomes over time

This page was built for person: Steffen Kopecki