Nie jesteś zalogowany | Zaloguj się

EF logic

Prelegent(ci)
Tomasz Idziaszek
Afiliacja
Uniwersytet Warszawski
Termin
10 grudnia 2008 14:15
Pokój
p. 5870
Seminarium
Seminarium „Teoria automatów”

I will talk about a simple temporal logic EF over finite words, infinite words and finite trees. I will show that a language is definable by an EF formula if and only if its syntactic algebra satisfies certain equations. Eventually I will present some examples which exhibit the difficulty of EF over infinite trees.