Weak automata and Wadge hierarchy

Prelegent(ci)

Filip Murlak

Afiliacja

Uniwersytet Warszawski

Termin

15 listopada 2006 14:15

Pokój

p. 5870

Seminarium

Seminarium „Teoria automatów”

---

I will show a new lower bound for the height of the Wadge hierarchy of weak tree languages, i. e., the languages of infinite trees recognizable with weak automata. To this end I will prove that the family of weak tree languages is closed by three natural set-theoretic operations that can be used to climb up the hierarchy starting from the simplest sets.

---