tree automaton

(redirected from Deterministic finite tree automaton)
Also found in: Acronyms, Wikipedia.

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.
Full browser ?