BEGIN:VCALENDAR
PRODID:-//SMW Project//Semantic Result Formats
VERSION:2.0
METHOD:PUBLISH
X-WR-CALNAME:International Center for Computational Logic
X-WR-CALDESC:
BEGIN:VEVENT
SUMMARY:On the Complexity of Universality for Partially Ordered NFAs
URL://iccl.inf.tu-dresden.de/web/On_the_Complexity_of_Universality_for_Partially_Ordered_NFAs
UID://iccl.inf.tu-dresden.de/web/On_the_Complexity_of_Universality_for_Partially_Ordered_NFAs
DTSTART:20160706T145000
DTEND:20160706T155000
LOCATION:APB 3027
DTSTAMP:20181018T033346
SEQUENCE:26784
END:VEVENT
END:VCALENDAR