Alternating tree automata
(Redirected from 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).
Computational complexity
[edit]The emptiness problem (deciding whether the language of an input ATA is empty) for ATAs, and therefore its complement, the universality problem, are EXPTIME-complete.[1] The membership problem (testing whether an input tree is accepted by an input AFA) is in PTIME[1].
References
[edit]