You can find here exercise sheets for the Tree Automata Techniques and Applications course taught in MPRI M1 at ENS Paris-Saclay.
Exercise session 1 [ PDF ]: Recognizable Tree Languages and Finite Tree Automata. Solutions.
Exercise session 2 [ PDF ]: Decision Problems and Tree Homomorphisms. Solutions.
Exercise session 3 [ PDF ]: Mostly exercise sheet 2 again.
Exercise session 4 [ PDF ]: Logic and Hedges. Solutions.
Preparation to the exam :