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:68a67a19bfa31
DTSTART;TZID=America/Toronto:20180829T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180829T133000
URL:/computer-science/events/seminar-algorithms-and-com
 plexity-counting-subwords-and
SUMMARY:Seminar • Algorithms and Complexity — Counting Subwords and\nRe
 gular Languages
CLASS:PUBLIC
DESCRIPTION:Summary \n\nFINN LIDBETTER\, MASTER’S CANDIDATE\n_David R. Ch
 eriton School of Computer Science_\n\nLet x and y be words. We consider th
 e 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 i
 s 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 the
 se languages to\nbe regular\, and we show how to check this condition effi
 ciently. \n 
DTSTAMP:20250821T014457Z
END:VEVENT
END:VCALENDAR