Jump to content

Alternating tree automata

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jesse V. (talk | contribs) at 06:25, 25 December 2012 (tags and general fixes, added orphan tag using AWB (8842)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Alternating_tree_automata&oldid=529690575"