Explore relationships

Alternating tree automaton

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).

Use + to expand a branch. Click a topic name to open its summary.