tree automaton

(redirected from Nondeterministic tree automaton)

tree automaton

[′trē ‚ȯd·ə‚mā·shən]
(computer science)
An automaton that processes inputs in the form of trees, usually trees associated with parsing expressions in context-free languages.
References in periodicals archive ?
Consider a nondeterministic tree automaton A = <[Sigma], Q, [Delta], [q.
Hence, A' can be viewed as a nondeterministic tree automaton.
Full browser ?