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/en
URL://iccl.inf.tu-dresden.de/web/On_the_Complexity_of_Universality_for_Partially_Ordered_NFAs/en
UID://iccl.inf.tu-dresden.de/web/On_the_Complexity_of_Universality_for_Partially_Ordered_NFAs/en
DTSTAMP:20160701T100119
SEQUENCE:20679
END:VEVENT
END:VCALENDAR