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


© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search