Alternating tree automata

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In automata theory, an alternating tree automaton is an extension of nondeterministic tree automaton as same as alternating finite automaton extends nondeterministic finite automaton (NFA).