Restarting Tree Automata

In the last years there was a growing effort to investigate language classes recognized by different variants of restarting automata. Moreover, tree automata have ained much attention in the computer science community, mainly due to their fruitful applications in abstract interpretation, automated theorem proving, logical reasoning, and program verification.
The subject of this book is a comprehensive study of a new tree automaton model - the so-called restarting tree automaton. The thesis explores the expressive power and the formal properties of this new model. Furthermore, some possible variations are considered.