Department Theoretical Computer Science | Publications : Technical Reports

university

sitemap

contact

Universität Stuttgart

Theoretical Computer Science : Publications

Technical Reports

Year 2015

No. 18: Fleischer, Lukas: Minimierung und effiziente Algorithmen für erkennende Homomorphismen über omega-regulären Sprachen, Technical Report No. 2015/18.

Year 2014

No. 100: Haas, Stephan: Autonome Selbstlokalisierung und Tracking basierend auf Mobilfunkbasisstationen, Technical Report No. 2014/100.
No. 3528: Hartmann, Frederik: Routenplanung mit Nebenbedingungen, Technical Report No. 2014/3528.

Year 2013

No. 07: Kufleitner, Manfred; Lauser, Alexander: Nesting Negations in FO^2 over Finite Words, Technical Report No. 2013/07.
No. 80: Sanwald, Tim: Verkehrsabhängiges Routing basierend auf TMC Nachrichten, Technical Report No. 2013/80.

Year 2012

No. 03: Kufleitner, Manfred; Lauser, Alexander: Lattices of Logical Fragments over Words, Technical Report No. 2012/03.

Year 2011

No. 02: Kufleitner, Manfred; Lauser, Alexander: Cantor Topologies for Finite Words, Technical Report No. 2011/02.
No. 03: Kufleitner, Manfred; Lauser, Alexander: Around Dot-depth One, Technical Report No. 2011/03.

Year 2010

No. 01: Dartois, Luc; Kufleitner, Manfred; Lauser, Alexander: Rankers over Infinite Words, Technical Report No. 2010/01.
No. 02: Kopecki, Steffen: On the Iterated Hairpin Completion, Technical Report No. 2010/02.
No. 03: Kufleitner, Manfred; Lauser, Alexander: Partially Ordered Two-way Büchi Automata, Technical Report No. 2010/03.
No. 04: Diekert, Volker; Kopecki, Steffen: Complexity Results and the Growths of Hairpin Completions of Regular Languages, Technical Report No. 2010/04.
No. 06: Hoffmann, Benjamin: Comparison of Standard and Zipf-Based Document Retrieval Heuristics, Technical Report No. 2010/06.
No. 08: Kallas, Jakub; Kufleitner, Manfred; Lauser, Alexander: First-order Fragments with Successor over Infinite Words, Technical Report No. 2010/08.

Year 2009

No. 02: Fouz, Mahmoud; Kufleitner, Manfred; Manthey, Bodo; Zeini Jahromi, Nima: On Smoothed Analysis of Quicksort and Hoare's Find, Technical Report No. 2009/02.
No. 04: Diekert, Volker; Kufleitner, Manfred: Fragments of first-order logic over infinite words, Technical Report No. 2009/04.

Year 2007

No. 05: Kufleitner, Manfred: A Proof of the Factorization Forest Theorem, Technical Report No. 2007/05.

Year 2006

No. 03: Kufleitner, Manfred: Polynomials, Fragments of Temporal Logic and the Variety DA over Traces, Technical Report No. 2006/03.
No. 04: Göller, Stefan; Lohrey, Markus: Infinite State Model-Checking of Propositional Dynamic Logics, Technical Report No. 2006/04.
No. 06: Horsch, Martin; Kufleitner, Manfred: The Expressive Power of Simple Logical Fragments over Traces, Technical Report No. 2006/06.

Year 2005

No. 01: Lohrey, Markus: Model-Checking Hierarchical Structures, Technical Report No. 2005/01.
No. 02: Lohrey, Markus; Ondrusch, Nicole: Inverse monoids: decidability and complexity of algebraic questions, Technical Report No. 2005/02.
No. 04: Göller, Stefan; Lohrey, Markus: Fixpoint logics on hierarchical structures, Technical Report No. 2005/04.
No. 07: Lohrey, Markus; Kuske, Dietrich: First-order and counting theories of omega-automatic structures, Technical Report No. 2005/07.

Year 2001

No. 10: Diekert, Volker; Lohrey, Markus: Existential and Positive Theories of Equations in Graph Products, Technical Report No. 2001/10.

Year 1999

No. 05: Lohrey, Markus; ,: Complexity Results for Confluence Problems, Technical Report No. 1999/05.

Year 1998

No. 01: Petersen, Holger: Formal Languages, Automata and Petri-Nets, Technical Report No. 1998/01.
No. 02: Diekert, Volker: Makanin's Algorithm for Solving Word Equations with Regular Constraints, Technical Report No. 1998/02.

Year 1997

No. 01: Diekert, Volker; Matiyasevich, Yuri; Muscholl, Anca: Solving Trace Equations Using Lexicographical Normal Forms, Technical Report No. 1997/01.
No. 05: Diekert, Volker; Kobayashi, Yuji: Some Identities Related to Automata, Determinants, and Möbius Functions, Technical Report No. 1997/05.
No. 07: Petersen, Holger: A Census Technique for Simple Computing Devices, Technical Report No. 1997/07.

Year 1996

No. 02: Diekert, Volker; Métivier, Yves: Partial Commutation and Traces, Technical Report No. 1996/02.
No. 04: Hertrampf, Ulrich; Bergen, Andreas: 32. Workshop ueber Komplexitaetstheorie, Datenstrukturen und effiziente Algorithmen, Technical Report No. 1996/04.
No. 15: Hertrampf, Ulrich: Acceptance by Transformation Monoids (with an Application to Local Self Reductions), Technical Report No. 1996/15.

Year 1995

No. 07: Bräunl, Thomas: COMROS : Cooperative Mobile Robotersysteme Stuttgart: Basis-Dokumentation, Technical Report No. 1995/07.

Year 1994

No. 01: Diekert, Volker (ed.); Teodosiu, Dan (ed.): 3. Theorietag 'Automaten und Formale Sprachen', Schloß Dagstuhl, 7./8. Oktober 1993, Technical Report No. 1994/01.

Year 1992

No. 04: Diekert, Volker (ed.); Ebinger, Werner (ed.): Proceedings ASMICS Workshop : infinite traces ; Tübingen, Jan. 23-25, 1992, Technical Report No. 1992/04.