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:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682b234beba1c
DTSTART;TZID=America/Toronto:20181212T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181212T133000
URL:/computer-science/events/masters-thesis-presentatio
 n-algorithms-and-complexity-1
SUMMARY:Master’s Thesis Presentation • Algorithms and Complexity —\nC
 ounting\, Adding\, and Regular Languages
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTHOMAS LIDBETTER\, MASTER CANDIDATE\n_David R. Cher
 iton School of Computer Science_\n\nIn this talk we consider two mostly di
 sjoint topics in formal language\ntheory that both involve the study and u
 se of regular languages. The\nfirst topic lies in the intersection of auto
 mata theory and additive\nnumber theory. \n 
DTSTAMP:20250519T122547Z
END:VEVENT
END:VCALENDAR