BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260525T035932Z
UID:Seminar-ACTO-492@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Nikhil Mande:MAILTO:Nikhil.Mande@liverpool
DTSTART:20190213T140000
DTEND:20190213T150000
SUMMARY:Algorithms, Complexity Theory and Optimisation Series
DESCRIPTION:Andrew Ryzhikov: Synchronization and mortality in finite automata\n\nWe study approximation algorithms for two closely related problems:  the problems of finding a short synchronizing and a short mortal word for  a given prefix code. Intuitively, a synchronizing word is a word guaranteeing a unique interpretation, and a mortal word is a word guaranteeing no interpretations for any sequence of codewords containing it. We concentrate on the case of finite prefix codes and consider both the cases where the code is defined by listing all its codewords and where the code is defined by an automaton recognizing the star of the code.\n\nThis is a joint work with Marek Szyku?a (University of Wroclaw).\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=492
LOCATION:
END:VEVENT
END:VCALENDAR