Complexity of infinite tree languages --- when automata meet topology

19^th October 2010, 16:00
Prof Damian Niwinski
Faculty of Mathematics, Informatics and Mechanics, Warsaw University, Poland