BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260920T212433Z
UID:Seminar-dept-1231@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20240411T110000
DTEND:20240411T120000
SUMMARY:School Seminar Series
DESCRIPTION:Prof. Stefan Kiefer: On unambiguous finite automata\n\nFinite automata are fundamental for automated verification. A nondeterministic finite automaton is called unambiguous if every accepted word has only one accepting run. Thus, unambiguous automata are in between deterministic and nondeterministic automata. They are naturally connected to linear algebra and combinatorics. The infinite-word version of unambiguous automata, unambiguous Büchi automata, can be used to model check Markov chains. These algorithms are both mathematically elegant and practically efficient for the verification of probabilistic systems. Based on new connections to communication complexity, there has been recent progress around state minimisation and the complexity of language operations on unambiguous automata.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1231
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR