BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Japan
2 × Canada
Collaborated with:
V.Diekert L.Kari P.Meunier M.J.Patitz S.Seki
Talks about:
complet (4) regular (3) hairpin (3) languag (2) synthesi (1) whether (1) pattern (1) complex (1) result (1) growth (1)

Person: Steffen Kopecki

DBLP DBLP: Kopecki:Steffen

Contributed to:

ICALP (1) 20152015
CIAA 20102010
CIAA 20102011
DLT 20102010

Wrote 4 papers:

ICALP-v1-2015-KariKMPS #np-hard #set #synthesis
Binary Pattern Tile Set Synthesis Is NP-hard (LK, SK, PÉM, MJP, SS), pp. 1022–1034.
CIAA-2010-DiekertK #complexity #regular expression
Complexity Results and the Growths of Hairpin Completions of Regular Languages (VD, SK), pp. 105–114.
CIAA-J-2010-DiekertK11 #regular expression
It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular (VD, SK), pp. 1813–1828.
DLT-2010-Kopecki #on the
On the Iterated Hairpin Completion (SK), pp. 438–439.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.