20. September 2021

  • 14:00–15:00 Uhr — Maneth (eingeladener Vortrag)
    "Definability Results for Top-Down Tree Transducers"
  • 15:30–16:30 Uhr — Alhazov, Freund, Ivanov, Oswald, Verlan
    "Simple Catalytic P Systems Working in New Derivation Modes"
  • 16:30–17:00 Uhr — Birkmann, Milius, Urbat
    "Quantum Automata and Basic Varieties of Languages"
  • 17:00–17:30 Uhr — Meenakshi, Murali, Suseelan, Thomas
    "Weighted Hexagonal Picture Automata"

21. September 2021

  • 14:00–14:30 Uhr — Gruber, Holzer
    "Optimal Regular Expressions for Palindromes of Given Length"
  • 14:30–15:00 Uhr — Hoffmann
    "State Complexity Investigations on Commutative Regular Languages"
  • 15:00–15:30 Uhr — Holzer, Rauch
    "The Range of State Complexities of Languages Resulting from the Cascade Product"
  • 16:00–16:30 Uhr — Kosche, Koß, Manea, Siemer
    "Absent Subsequences in Words"
  • 16:30–17:00 Uhr — Gawrychowski, Manea, Siemer
    "Matching Patterns with Variables under Hamming Distance"
  • 17:00–17:30 Uhr — Fernau
    "Zur parameterisierten Komplexität formalsprachlicher Probleme"
  • 17:30–18:00 Uhr — Bericht des Sprechers der Fachgruppe
  • 18:00–19:00 Uhr — Knight (eingeladener Vortrag)
    "Are Automata Important for Machine Translation?"