Talks

Showing 1 - 11 of 11 Results

  • Date
     
    Title
  • 24/10/2019
    10:00 - 10:30
    BSc
    Regular Sensing for Nested Word Automta
    Alina Ibach
  • 25/10/2019
    10:00 - 11:00
    ATI
    Tree automata with global constraints for infinite trees
    Patrick Landwehr
    We study an extension of tree automata on infinite trees with global equality and disequality constraints. These constraints can enforce that all subtrees for which in the accepting run a state q is reached (at the root of that subtree) are identical, or that these trees differ from the subtrees at which a state q' is reached. We consider the closure properties of this model, its decision problems and its connection to logic.
  • 08/11/2019
    10:00 - 11:00
    ATI
    Expanding the quasi polynomial time bound for graph isomorphism
    Daniel Wiebking
  • 15/11/2019
    10:00 - 11:00
    ATI
  • 22/11/2019
    10:00 - 11:00
    ATI
  • 29/11/2019
    10:00 - 11:00
    ATI
  • 29/11/2019
    10:00 - 11:00
    ATI
  • 06/12/2019
    10:00 - 11:00
    ATI
  • 13/12/2019
    10:00 - 11:00
    ATI
  • 10/01/2020
    10:00 - 11:00
    ATI
  • 17/01/2020
    10:00 - 11:00
    ATI