joint work with Mikołaj Bojańczyk

Speaker(s)

Thomas Place

Affiliation

Uniwersytet Warszawski

Date

Jan. 11, 2012, 2:15 p.m.

Room

room 5870

Title in Polish

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

Seminar

Seminar Automata Theory

---

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.

---