BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Online Space Complexity - Nathanaël Fijalkow\, Laboratoire d'Info
 rmatique Algorithmique: Fondements et Applications (LIAFA)\, Université P
 aris Diderot - Paris 7
DTSTART:20151113T140000Z
DTEND:20151113T150000Z
UID:TALK62381@talks.cam.ac.uk
CONTACT:Ohad Kammar
DESCRIPTION:The Online Space Complexity of a language L (over finite words
 ) is a\ncomplexity measure aiming at quantifying the amount of information
  (in\nterms of space consumption) needed to process words letter by letter
 \nand maintaining the answer to the Boolean query "is the word read so\nfa
 r in L?".\n\nThe aim of this talk is to motivate the study of Online Space
 \nComplexity and to give an overview of the preliminary results we\nobtain
 ed so far. In particular\, we'll discuss the Online Space\nComplexity of P
 robabilistic Languages.\n
LOCATION:FW26
END:VEVENT
END:VCALENDAR