Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Steffen Kopecki" ( http://dblp.L3S.de/Authors/Steffen_Kopecki )

  Author page on DBLP  Author page in RDF  Community of Steffen Kopecki in ASPL-2

Publication years (Num. hits)
2009 (1) 2010 (3) 2011 (9) 2012 (1)
Publication types (Num. hits)
article(9) inproceedings(4) phdthesis(1)
Venues (Conferences, Journals, ...)
CoRR(6) CIAA(1) Developments in Language Theor...(1) Fundam. Inform.(1) ICTAC(1) Int. J. Found. Comput. Sci.(1) SOFSEM(1) Theor. Comput. Sci.(1)
Authors
Steffen Kopecki(14) Lila Kari(5) Volker Diekert(5) Shinnosuke Seki(4) Victor Mitrana(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 14 publication records. Showing 14 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Lila Kari, Steffen Kopecki, Shinnosuke Seki Iterated Hairpin Completions of Non-crossing Words. Search on Bibsonomy SOFSEM The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Steffen Kopecki Formal language theory of hairpin formations. Search on Bibsonomy 2011   RDF
1Steffen Kopecki On iterated hairpin completion. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Steffen Kopecki It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lila Kari, Shinnosuke Seki, Steffen Kopecki On the Regularity of Iterated Hairpin Completion of a Single Word. Search on Bibsonomy Fundam. Inform. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lila Kari, Steffen Kopecki, Shinnosuke Seki On the regularity of iterated hairpin completion of a single word Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Volker Diekert, Steffen Kopecki, Victor Mitrana Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Lila Kari, Steffen Kopecki, Shinnosuke Seki Iterated Hairpin Completions of Non-crossing Words Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Lila Kari, Steffen Kopecki Deciding if a Regular Language is Generated by a Splicing System Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Volker Diekert, Steffen Kopecki It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Steffen Kopecki On the Iterated Hairpin Completion Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Steffen Kopecki On the Iterated Hairpin Completion. Search on Bibsonomy Developments in Language Theory The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Steffen Kopecki Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract). Search on Bibsonomy CIAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Steffen Kopecki, Victor Mitrana On the Hairpin Completion of Regular Languages. Search on Bibsonomy ICTAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #14 of 14 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.