6th International School on Rewriting
July 16th - 20th, 2012. Valencia, Spain
TAT: Tree Automata, Turing Machines and Term Rewriting
The main purpose of this course is to give an overview on the connections between tree automata and rewriting.
Connections between Tree Automata and Term Rewriting are very strong. Whereas tree automata can be viewed as a subclass of ground rewrite systems, tree automata are successfully used as decision tools in rewriting theory. Furthermore, applications, including rewriting theory, have influenced the definition of extensions of tree automata. We will survey different classes of tree automata from a rewriting point of view. We will also remind some properties of Turing machines.
