Topic summary
Alternating tree automaton
Extracted from the Wikipedia article Alternating tree automata.
In automata theory, an alternating tree automaton (ATA) is a generalisation of a nondeterministic tree automaton in the same way that an alternating finite automaton is a generalisation of a nondeterministic finite automaton (NFA).