Automata, Verification, and Infinite Games, Lecture 18:Non-counting languages, Expressiveness of LTL

New channel STCS TIFR: title sample judged 'whole' (Nearly all uploads are full academic lectures, seminars, and colloquia from a TIFR CS department, with only an occasiona); 1 of 3 sampled transcripts showed teaching, 0 not; every title checked strictly; oEmbed verified.

A 87-minute video from STCS TIFR: “Automata, Verification, and Infinite Games, Lecture 18:Non-counting languages, Expressiveness of LTL”.

Video by STCS TIFR, played through YouTube's embedded player.