Steffen Kopecki

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Volker Diekert

> Home > Persons > Steffen Kopecki

Publications

2012
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/DiekertKM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/DiekertKM12
Volker Diekert, Steffen Kopecki, Victor Mitrana:
Deciding regularity of hairpin completions of regular languages in polynomial time. Inf. Comput. 217: 12-30 (2012)
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/DiekertK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DiekertK12
Volker Diekert, Steffen Kopecki:
Language theoretical properties of hairpin formations. Theor. Comput. Sci. 429: 65-73 (2012)
2011
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/ijfcs/DiekertK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/DiekertK11
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)
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1101-4824
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1101-4824
Volker Diekert, Steffen Kopecki:
It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular. CoRR abs/1101.4824 (2011)
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1108-2427
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1108-2427
Volker Diekert, Steffen Kopecki, Victor Mitrana:
Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time. CoRR abs/1108.2427 (2011)
2010
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/wia/DiekertK10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wia/DiekertK10
Volker Diekert, Steffen Kopecki:
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract). CIAA 2010: 105-114
2009
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/ictac/DiekertKM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ictac/DiekertKM09
Volker Diekert, Steffen Kopecki, Victor Mitrana:
On the Hairpin Completion of Regular Languages. ICTAC 2009: 170-184

a service of

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.