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/en
URL://iccl.inf.tu-dresden.de/web/On_the_Complexity_of_k-Piecewise_Testability_and_the_Depth_of_Automata/en
UID://iccl.inf.tu-dresden.de/web/On_the_Complexity_of_k-Piecewise_Testability_and_the_Depth_of_Automata/en
DTSTAMP:20150830T042041
SEQUENCE:16915
END:VEVENT
END:VCALENDAR