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 k-Piecewise Testability and the Depth of Automata
URL://iccl.inf.tu-dresden.de/web/On_the_Complexity_of_k-Piecewise_Testability_and_the_Depth_of_Automata
UID://iccl.inf.tu-dresden.de/web/On_the_Complexity_of_k-Piecewise_Testability_and_the_Depth_of_Automata
DTSTART:20150831T145000
DTEND:20150831T155000
LOCATION:APB 3105
DTSTAMP:20181018T035848
SEQUENCE:26806
END:VEVENT
END:VCALENDAR