Regular languages of infinite trees that are boolean combinations of open sets - continuation

Prelegent(ci)

Thomas Place

Afiliacja

Uniwersytet Warszawski

Termin

11 stycznia 2012 14:15

Pokój

p. 5870

Tytuł w języku angielskim

joint work with Mikołaj Bojańczyk

Seminarium

Seminarium „Teoria automatów”

---

This is the continuation of last week talk. Last week I presented a decidable characterization of the class of trees languages definable by boolean combinations of open sets. This week I will present part of the proof.

---