 |
|
|||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||
 |
||||||||||||||||||||||||||||||||||||
|
Veröffentlichungen / Publications2011Marriage BrokerVolker Claus, Volker Diekert, Holger PetersenIn: Algorithms Unplugged, Chapter 35, Pages 345-355, 2011.[Springer-Verlag] 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] Fragments of First-Order Logic over Infinite WordsVolker Diekert, Manfred KufleitnerTheory of Computing Systems, Vol. 48(3), Springer-Verlag (2011)[arXiv] [http] [© Springer-Verlag] Star-Free Languages are Church-Rosser CongruentialVolker Diekert, Manfred Kufleitner, Pascal WeilPreprint, 2011.[arXiv:1111.4300v1] On Computing Geodesics in Baumslag-Solitar GroupsVolker Diekert, Jürn LaunInternational Journal of Algebra and Computation, Volume 21, Pages 119-145, Number 1-2, World Scientific, 2011.[arxiv:0907.5114v2] [© World Scientific] Trace TheoryVolker Diekert, Anca MuschollIn: Encyclopedia of Parallel Computing, Part 20, Pages 2071-2079, Springer-Verlag, 2011.[pdf] [© Springer-Verlag] Solving Word Problems in Group Extensions over Infinite WordsVolker Diekert, Alexei G. MyasnikovDevelopments in Language Theory (DLT) 2011, Conference Proceedings, Volume 6795 of Lecture Notes in Computer Science, Pages 192-203, Springer-Verlag, 2011.[arXiv:1011.2024v2] [© Springer-Verlag] First-order Fragments with Successor over Infinite WordsJakub Kallas, Manfred Kufleitner, Alexander LauserTheoretical Aspects of Computer Science, International Symposium (STACS) 2011, Conference Proceedings, volume 9 of Leibniz International Proceedings in Informatics (LIPIcs), pages 356–367, Schloss Dagstuhl, 2011.[pdf] [http] 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] Partially Ordered Two-way Büchi AutomataManfred Kufleitner, Alexander LauserInternational Journal of Foundations of Computer Science, Vol. 22(8), World Scientific, 2011[pdf] [http] [© World Scientific Publishing Company] Languages of Dot-depth One over Infinite WordsManfred Kufleitner, Alexander LauserIEEE Symposium on Logic in Computer Science (LICS) 2011, Conference Proceedings, pages 23–32. IEEE Computer Society, 2011.[arXiv] Around Dot-depth OneManfred Kufleitner, Alexander LauserTechnical Report No. 2011/03, Computer Science, University of Stuttgart.[http] [arXiv] Cantor Topologies for Finite WordsManfred Kufleitner, Alexander LauserTechnical Report No. 2011/02, Computer Science, University of Stuttgart.[http] [arXiv] |
|
Letzte Änderung 22. Oct 2012 | © Universität Stuttgart | Impressum |