default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteffen Kopecki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j20]Karam Aloui, Damien Jamet, Hajime Kaneko, Steffen Kopecki, Pierre Popoli
, Thomas Stoll:
On the binary digits of n and n2. Theor. Comput. Sci. 939: 119-139 (2023)
2010 – 2019
- 2018
- [j19]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): 165 (2018) - [j18]Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
Transducer descriptions of DNA code properties and undecidability of antimorphic problems. Inf. Comput. 259(2): 237-258 (2018) - 2017
- [j17]Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki:
Binary Pattern Tile Set Synthesis Is NP-Hard. Algorithmica 78(1): 1-46 (2017) - [j16]Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
Further remarks on DNA overlap assembly. Inf. Comput. 253: 143-154 (2017) - [j15]Lila Kari, Steffen Kopecki:
Deciding whether a regular language is generated by a splicing system. J. Comput. Syst. Sci. 84: 263-287 (2017) - [j14]Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
On the overlap assembly of strings and languages. Nat. Comput. 16(1): 175-185 (2017) - 2016
- [j13]Rallis Karamichalis, Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Stephen Solis-Reyes:
Additive methods for genomic signatures. BMC Bioinform. 17: 313 (2016) - [j12]Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
Preface. Nat. Comput. 15(1): 1-3 (2016) - 2015
- [j11]Helmut Jürgensen, Lila Kari, Steffen Kopecki:
Methods for Relativizing Properties of Codes. Acta Cybern. 22(2): 259-292 (2015) - [j10]Rallis Karamichalis, Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
An investigation into inter- and intragenomic variations of graphic genomic signatures. BMC Bioinform. 16: 246:1-246:22 (2015) - [j9]Srujan Kumar Enaganti, Lila Kari, Steffen Kopecki:
A Formal Language Model of DNA Polymerase Enzymatic Activity. Fundam. Informaticae 138(1-2): 179-192 (2015) - [j8]Lila Kari, Steffen Kopecki, Shinnosuke Seki:
3-color bounded patterned self-assembly. Nat. Comput. 14(2): 279-292 (2015) - [c9]Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems. DCFS 2015: 141-152 - [c8]Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki:
Binary Pattern Tile Set Synthesis Is NP-hard. ICALP (1) 2015: 1022-1034 - [i11]Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems. CoRR abs/1503.00035 (2015) - 2014
- [j7]Lila Kari, Steffen Kopecki, Amirhossein Simjour:
Hypergraph Automata: a Theoretical Model for patterned Self-assembly. Int. J. Found. Comput. Sci. 25(4): 419-440 (2014) - [j6]Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
On the maximality of languages with combined types of code properties. Theor. Comput. Sci. 550: 79-89 (2014) - [e1]Oscar H. Ibarra, Lila Kari, Steffen Kopecki:
Unconventional Computation and Natural Computation - 13th International Conference, UCNC 2014, London, ON, Canada, July 14-18, 2014, Proceedings. Lecture Notes in Computer Science 8553, Springer 2014, ISBN 978-3-319-08122-9 [contents] - [i10]Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki:
Binary pattern tile set synthesis is NP-hard. CoRR abs/1404.0967 (2014) - [i9]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 abs/1406.1041 (2014) - 2013
- [c7]Lila Kari, Steffen Kopecki, Shinnosuke Seki:
3-Color Bounded Patterned Self-assembly - (Extended Abstract). DNA 2013: 105-117 - [c6]Lila Kari, Steffen Kopecki, Amirhossein Simjour:
Hypergraph Automata: A Theoretical Model for Patterned Self-assembly. UCNC 2013: 125-137 - [i8]Lila Kari, Steffen Kopecki, Amirhossein Simjour:
Hypergraph Automata: A Theoretical Model for Patterned Self-assembly. CoRR abs/1302.2840 (2013) - [i7]Lila Kari, Steffen Kopecki, Shinnosuke Seki:
3-color Bounded Patterned Self-assembly. CoRR abs/1306.3257 (2013) - 2012
- [j5]Volker Diekert, Steffen Kopecki, Victor Mitrana:
Deciding regularity of hairpin completions of regular languages in polynomial time. Inf. Comput. 217: 12-30 (2012) - [j4]Volker Diekert, Steffen Kopecki:
Language theoretical properties of hairpin formations. Theor. Comput. Sci. 429: 65-73 (2012) - [c5]Lila Kari, Steffen Kopecki:
Deciding Whether a Regular Language Is Generated by a Splicing System. DNA 2012: 98-109 - [c4]Lila Kari, Steffen Kopecki, Shinnosuke Seki:
Iterated Hairpin Completions of Non-crossing Words. SOFSEM 2012: 337-348 - 2011
- [b1]Steffen Kopecki:
Formal language theory of hairpin formations. University of Stuttgart, Germany, 2011, pp. 1-67 - [j3]Lila Kari, Shinnosuke Seki, Steffen Kopecki:
On the Regularity of Iterated Hairpin Completion of a Single Word. Fundam. Informaticae 110(1-4): 201-215 (2011) - [j2]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): 1813-1828 (2011) - [j1]Steffen Kopecki:
On iterated hairpin completion. Theor. Comput. Sci. 412(29): 3629-3638 (2011) - [p1]Steffen Kopecki:
Formalsprachliche Theorie der Haarnadelstrukturen. Ausgezeichnete Informatikdissertationen 2011: 121-130 - [i6]Volker Diekert, Steffen Kopecki:
It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular. CoRR abs/1101.4824 (2011) - [i5]Lila Kari, Steffen Kopecki, Shinnosuke Seki:
On the regularity of iterated hairpin completion of a single word. CoRR abs/1104.2385 (2011) - [i4]Volker Diekert, Steffen Kopecki, Victor Mitrana:
Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time. CoRR abs/1108.2427 (2011) - [i3]Lila Kari, Steffen Kopecki, Shinnosuke Seki:
Iterated Hairpin Completions of Non-crossing Words. CoRR abs/1110.0760 (2011) - [i2]Lila Kari, Steffen Kopecki:
Deciding if a Regular Language is Generated by a Splicing System. CoRR abs/1112.4897 (2011) - 2010
- [c3]Steffen Kopecki:
On the Iterated Hairpin Completion. Developments in Language Theory 2010: 438-439 - [c2]Volker Diekert, Steffen Kopecki:
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract). CIAA 2010: 105-114 - [i1]Steffen Kopecki:
On the Iterated Hairpin Completion. CoRR abs/1010.3640 (2010)
2000 – 2009
- 2009
- [c1]Volker Diekert, Steffen Kopecki, Victor Mitrana:
On the Hairpin Completion of Regular Languages. ICTAC 2009: 170-184
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
