Vorlesung

Diese Veranstaltung ergänzt die Vorlesung Formale Sprachen und Automatentheorie und das das Modul Theoretische Grundlagen der Informatik. Es werden Inhalte der Vorlesungen und Übungen des ersten Studienjahres wiederholt, ergänzt durch weiterführende Ergebnisse, alternative Beweise und zusätzliche Beispiele.

Wer konkrete Wünsche zum Inhalt hat, kann diese per E-Mail an den Dozenten äußern.

Zeit	Raum	Termine
Fr 09:45–11:15	V38.01	wöchentlich ab 13.04. bis 20.07.	außer am 01.06.; am 20.07. in V38.04
Fr 11:30–13:00	V38.04	wöchentlich ab 13.04. bis 20.07.	außer am 04.05., 18.05., 01.06.

Die Vorlesungumfrage findet am 15.06. statt.

Am 13.07. wird der erste Vorlesungsteil von V38.01 in den HS-Pool verlegt.

Am 20.07. (letzter Semestertag) findet anstelle der Vorlesung ein Quiz zur Vorbereitung auf die Prüfungsklausur im August statt. Die Veranstaltung wird daher ab 9.45 Uhr durchgehend in den Raum V38.04 verlegt.

Am 23.08. wird ab 14.00 Uhr in V38.04 eine Fragestunde zur Prüfungsklausur angeboten. Auf Wunsch wird dort auch das Quiz besprochen.

Materialien

Vorlesung 1 - 13.04.2012
Vorlesung 2 - 20.04.2012
Vorlesung 3 - 27.04.2012
Vorlesung 4 - 04.05.2012
Vorlesung 5 - 11.05.2012
Vorlesung 6 - 18.05.2012
Vorlesung 7 - 25.05.2012
Vorlesung 8 - 08.06.2012
Vorlesung 9 - 15.06.2012
Vorlesung 10 - 22.06.2012
Vorlesung 11 - 29.06.2012 (Lösungsvorschläge)
Vorlesung 12 - 06.07.2012
Vorlesung 13 - 13.07.2012 (zusätzliche Materialien: Webadresse.zip, [LoopLexerVorlage.zip][llexser], Webadresse2.zip, LoopParserVorlage.zip)

Literatur

Ein - teils kommentiertes - Literaturverzeichnis finden Sie in den Materialien zur Vorlesung.

News

[Jun’23] The paper “Parallel algorithms for power circuits and the word problem of the Baumslag group” by Caroline Mattes and Armin Weiß has been accepted at Computational Complexity.

[Oct’22] The paper “Lower Bounds for Sorting 16, 17, and 18 Elements” by Florian Stober and Armin Weiß has been accepted at ALENEX 2023.

[Sep’22] The paper “Conelikes and Ranker Comparisons” by Viktor Henriksson and Manfred Kufleitner has been accepted at LATIN 2022.

[Sep’22] The paper “Improved Parallel Algorithms for Generalized Baumslag Groups” by Caroline Mattes and Armin Weiß has been accepted at LATIN 2022.

[Apr’22] The paper “Reachability Games and Parity Games” by Volker Diekert and Manfred Kufleitner has been accepted at ICTAC 2022.

[Apr’22] The paper “Satisfiability Problems for Finite Groups” by Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski and Armin Weiß has been accepted at ICALP 2022.

All news

[Mar’22] The paper “The Power Word Problem in Graph Products” by Florian Stober and Armin Weiß was accepted at DLT 2022.

[Nov’20] Volker Diekert is Partner Investigator in the Australian ARC grant “Geodetic groups: foundational problems in algebra and computer science” at University of Technology Sydney.

[Apr’20] The paper “Groups with ALOGTIME-hard word problems and PSPACE-complete circuit value problems” by Laurent Bartholdi, Michael Figelius, Markus Lohrey and Armin Weiß has been accepted at CCC 2020.

[Apr’20] The paper “Hardness of equations over finite solvable groups under the exponential time hypothesis” by Armin Weiß has been accepted at ICALP 2020.

[Dec’19] The paper “An Automaton Group with PSPACE-Complete Word Problem” by Jan Philipp Wächter and Armin Weiß has been accepted at STACS 2020.

[Nov’19] Carlos Camino was awarded the stuvus Special Prize for exceptional commitment in teaching.

[Jun’19] The paper “The power word problem” by Markus Lohrey and Armin Weiß has been accepted at MFCS 2019.

[May’19] The paper “On the Average Case of MergeInsertion” by Florian Stober and Armin Weiß has been accepted at IWOCA 2019.

[Oct’18] The paper “Worst-Case Efficient Sorting with QuickMergesort” by Stefan Edelkamp and Armin Weiß has been accepted at ALENEX 2019.

[Jun’18] At CCC 2018, Lukas Fleischer received a Best Student Paper Award for his submission “On the Complexity of the Cayley Semigroup Membership Problem”.

[Jun’18] The paper “Testing Simon’s congruence” by Lukas Fleischer and Manfred Kufleitner was accepted at MFCS 2018.

[Jun’18] The paper “The Intersection Problem for Finite Semigroups” by Lukas Fleischer was accepted at DLT 2018.

[Apr’18] The paper “The isomorphism problem for finite extensions of free groups is in PSPACE” by Géraud Sénizergues and Armin Weiß was accepted at ICALP 2018.

[Apr’18] The paper “On the Complexity of the Cayley Semigroup Membership Problem” by Lukas Fleischer was accepted at CCC 2018.

[Jan’18] On March 24-29, 2019 Volker Diekert, Markus Lohrey, Olga Kharlampovich and Alexei Miasnikov will organize the Schloss Dagstuhl Seminar “Algorithmic Problems in Group Theory”.

[Dec’17] The paper “The Intersection Problem for Finite Monoids” by Lukas Fleischer and Manfred Kufleitner was accepted at STACS 2018.

[Jun’17] At the 12th International Computer Science Symposium in Russia (CSR), Lukas Fleischer and Manfred Kufleitner received a Best Paper Award for their publication “Green’s Relations in Finite Transformation Semigroups”, and Armin Weiss received a Best Paper Award for “The conjugacy problem in free solvable groups and wreath product of abelian groups is in $\text{TC}^0$ “ which is joint work with Alexei Miasnikov and Svetla Vassileva.