Tree Automata

Abstract

Most machine models one studies in theoretical computer science, like Turing machines and finite automata, work on inputs that are strings over some finite alphabet. However, often problem descriptions have inputs that more structured than strings. For example, the input could be a graph, or a tree, or a partial order, etc. We will now introduce an automaton model that computes on inputs that are trees.