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:69d95c3ecdd27
DTSTART;TZID=America/Toronto:20181212T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181212T133000
URL:https://uwaterloo.ca/computer-science/events/masters-thesis-presentatio
 n-algorithms-and-complexity-1
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:Master’s Thesis Presentation • Algorithms and Complexity —\nC
 ounting\, Adding\, and Regular Languages
CLASS:PUBLIC
DESCRIPTION:THOMAS LIDBETTER\, MASTER CANDIDATE\n_David R. Cheriton School 
 of Computer Science_\n\nIn this talk we consider two mostly disjoint topic
 s in formal language\ntheory that both involve the study and use of regula
 r languages. The\nfirst topic lies in the intersection of automata theory 
 and additive\nnumber theory. 
DTSTAMP:20260410T202326Z
END:VEVENT
END:VCALENDAR