BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d9976234aca
DTSTART;TZID=America/Toronto:20180829T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180829T133000
URL:https://uwaterloo.ca/computer-science/events/seminar-algorithms-and-com
 plexity-counting-subwords-and
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:Seminar • Algorithms and Complexity — Counting Subwords and\nRe
 gular Languages
CLASS:PUBLIC
DESCRIPTION:FINN LIDBETTER\, MASTER’S CANDIDATE\n_David R. Cheriton Schoo
 l of Computer Science_\n\nLet x and y be words. We consider the languages 
 whose words z are\nthose for which the numbers of occurrences of x and y\,
  as subwords of\nz\, are the same (resp.\, the number of x's is less than 
 the number of\ny's\, resp.\, is less than or equal). In this talk we will
  give a\nnecessary and sufficient condition on x and y for these languages
  to\nbe regular\, and we show how to check this condition efficiently. 
DTSTAMP:20260411T003546Z
END:VEVENT
END:VCALENDAR