Bild mit Unilogo
homeicon uni sucheicon suche kontakticon kontakt impressicon impressum
unilogo Universität Stuttgart 
Institut für Formale Methoden der Informatik

Abteilung Theoretische Informatik

 

Kopecki


2012:

Language theoretical properties of hairpin formations

Volker Diekert, Steffen Kopecki

Theoretical Computer Science, Volume 429, Pages 65-73, Elsevier, 2012.
[© Elsevier]

Deciding regularity of hairpin completions of regular languages in polynomial time

Volker Diekert, Steffen Kopecki, Victor Mitrana

Information and Computation, Volume 217, Pages 12-30, Elsevier, 2012.
[arXiv:11082427v1] [© ScienceDirect]

Deciding Whether a Regular Language is Generated by a Splicing System

Lila Kari, Steffen Kopecki

Accepted by DNA 18, 2012.
[arXiv:1112.4897]

Iterated Hairpin Completions of Non-crossing Words

Lila Kari, Steffen Kopecki, Shinnosuke Seki

In M. Bioliková, G. Friedrich, G. Gottlob, S.Katyenbeisser, and G. Turán (editors), 38th Conference on Current Trends in Theory and Practice of Computer Science, Volume 7147 of LNCS, Pages 337–348, 2011.
[Springer] [arXiv:1110.0760]

2011:

It is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular

Volker Diekert, Steffen Kopecki

International Journal of Foundations of Computer Science (IJFCS), Volume 22, Issue 8, Pages 1813-1828, World Scientific, 2011.
[arXiv:1101.4824v1] [© World Scientific]

On the Regularity of Iterated Hairpin Completion of a Single Word

Lila Kari, Steffen Kopecki, Shinnosuke Seki

On the Regularity of Iterated Hairpin Completion of a Single Word.
In Fundamenta Informaticae, volume 110(1-4), pages 201–215, 2011.
[IOS Press] [arXiv:1104.2385]

On Iterated Hairpin Completion

Steffen Kopecki

In Theoretical Computer Science, Volume 412, Issue 29, Pages 3629–3638, 2011.
[ScienceDirect] [arXiv:1010.3640v3]

2010:

Complexity Results and the Growths of Hairpin Completions of Regular Languages

Volker Diekert, Steffen Kopecki

In M. Domaratzki and K. Salomaa (editors), Implementation and Application of Automata - 15th International Conference, CIAA 2010, volume 6482 of LNCS, pages 105-114. Springer, 2011.
[Technical Report] [Springer]

On the Iterated Hairpin Completion

Steffen Kopecki

In Y. Gao, H. Lu, S. Seki, and S. Yu (editors), 14th Developments in Language Theory, volume 6224 of LNCS, pages 438-439. Springer, 2010.
[Technical Report] [Poster] [Springer]

2009:

On the Hairpin Completion of Regular Languages

Volker Diekert, Steffen Kopecki, Victor Mitrana

In M. Leucker and C. Morgan, editors, ICTAC, volume 5684 of Lecture Notes in Computer Science, pages 170-184. Springer, 2009.
[Springer]