Alternating tree automata

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

Computational complexity[edit]

The emptiness problem (deciding whether the language of an input ATA is empty) and the universality problem for ATAs are EXPTIME-complete.^[1] The membership problem (testing whether an input tree is accepted by an input AFA) is in PTIME^[1].

References[edit]

^ ^a ^b H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison et M. Tommasi, Tree Automata Techniques and Applications [1] (Theorem 7.5.1 and subsequent remark)

P ≟ NP

This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.

[comon2008tree-1] H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison et M. Tommasi, Tree Automata Techniques and Applications [1] (Theorem 7.5.1 and subsequent remark)

[1]