 |
|
|||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||
 |
||||||||||||||||||||||||||||||||||||
|
Kopecki2012:Language theoretical properties of hairpin formationsVolker Diekert, Steffen KopeckiTheoretical Computer Science, Volume 429, Pages 65-73, Elsevier, 2012.[© Elsevier] Deciding regularity of hairpin completions of regular languages in polynomial timeVolker Diekert, Steffen Kopecki, Victor MitranaInformation and Computation, Volume 217, Pages 12-30, Elsevier, 2012.[arXiv:11082427v1] [© ScienceDirect] Deciding Whether a Regular Language is Generated by a Splicing SystemLila Kari, Steffen KopeckiAccepted by DNA 18, 2012.[arXiv:1112.4897] Iterated Hairpin Completions of Non-crossing WordsLila Kari, Steffen Kopecki, Shinnosuke SekiIn M. Bioliková, G. Friedrich, G. Gottlob, S.Katyenbeisser, and G. Turán (editors), 38th Conference on Current Trends in Theorz 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 RegularVolker Diekert, Steffen KopeckiInternational 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 WordLila Kari, Steffen Kopecki, Shinnosuke SekiOn 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 CompletionSteffen KopeckiIn 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 LanguagesVolker Diekert, Steffen KopeckiIn 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 CompletionSteffen KopeckiIn 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 LanguagesVolker Diekert, Steffen Kopecki, Victor MitranaIn M. Leucker and C. Morgan, editors, ICTAC, volume 5684 of Lecture Notes in Computer Science, pages 170-184. Springer, 2009.[Springer] |
|
Letzte Änderung 22. Oct 2012 | © Universität Stuttgart | Impressum |