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

 

Veröffentlichungen / Publications

2011


Marriage Broker

Volker Claus, Volker Diekert, Holger Petersen

In: Algorithms Unplugged, Chapter 35, Pages 345-355, 2011.
[Springer-Verlag]

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]

Fragments of First-Order Logic over Infinite Words

Volker Diekert, Manfred Kufleitner

Theory of Computing Systems, Vol. 48(3), Springer-Verlag (2011)
[arXiv] [http] [© Springer-Verlag]

Star-Free Languages are Church-Rosser Congruential

Volker Diekert, Manfred Kufleitner, Pascal Weil

Preprint, 2011.
[arXiv:1111.4300v1]

On Computing Geodesics in Baumslag-Solitar Groups

Volker Diekert, Jürn Laun

International Journal of Algebra and Computation, Volume 21, Pages 119-145, Number 1-2, World Scientific, 2011.
[arxiv:0907.5114v2] [© World Scientific]

Trace Theory

Volker Diekert, Anca Muscholl

In: Encyclopedia of Parallel Computing, Part 20, Pages 2071-2079, Springer-Verlag, 2011.
[pdf] [© Springer-Verlag]

Solving Word Problems in Group Extensions over Infinite Words

Volker Diekert, Alexei G. Myasnikov

Developments 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 Words

Jakub Kallas, Manfred Kufleitner, Alexander Lauser

Theoretical 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 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]

Partially Ordered Two-way Büchi Automata

Manfred Kufleitner, Alexander Lauser

International 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 Words

Manfred Kufleitner, Alexander Lauser

IEEE Symposium on Logic in Computer Science (LICS) 2011, Conference Proceedings, pages 23–32. IEEE Computer Society, 2011.
[arXiv]

Around Dot-depth One

Manfred Kufleitner, Alexander Lauser

Technical Report No. 2011/03, Computer Science, University of Stuttgart.
[http] [arXiv]

Cantor Topologies for Finite Words

Manfred Kufleitner, Alexander Lauser

Technical Report No. 2011/02, Computer Science, University of Stuttgart.
[http] [arXiv]