The course first recapitulates basic knowledge concerning finite automata, context-free languages and Turing machines from the master studies; an emphasis is put on the rigorous approach and deeper understanding. The course is then devoted to some advanced parts in these and further areas (including, e.g., relation of languages and automata with logic, tree languages etc.).
Literature
M.Sipser: Introduction to the Theory of Computation (2nd ed.), Thomson 2006
Advised literature
D. Kozen: Automata and Computability, Springer 1997
D. Kozen: Theory of Computation; Springer 2006
J.E.Hopcroft, R. Motwani, J.D.Ullman: Introduction to Automata Theory, Languages and Computation. Addison Wesley, 2001
H. Comon et al.: Tree Automata Techniques and Applications; http://tata.gforge.inria.fr/ (2007)
Handbook of formal languages, Vol 1,2,3 (ed. G.Rozenberg) (Springer 1997)