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