Alternating tree automata

In automata theory, an alternating tree automaton (ATA) is a generalisation of a nondeterministic tree automaton in the same way that a alternating finite automaton is a generalisation of a nondeterministic finite automaton (NFA).

This article is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.