Two-way temporal logic over unranked trees

Prelegent(ci)

Mikołaj Bojańczyk

Afiliacja

Uniwersytet Warszawski

Termin

29 listopada 2006 14:15

Pokój

p. 5870

Seminarium

Seminarium „Teoria automatów”

---

I will talk about languages of unranked trees that can be defined in a temporal logic with two operators: exists some ancestor, and exists some descendant. The point is to have an algorithm, which decides if a given regular tree language can be expressed by a formula of this logic.

---