Alternating tree automata
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).
 | This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles; try the Find link tool for suggestions. (December 2012) |
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).
| P ≟ NP | This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it. |