NIST

deterministic finite tree automaton

(definition)

Definition: A deterministic finite state machine that accepts finitary trees rather than just strings. The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The acceptance condition is modified accordingly.

Also known as DFTA.

See also nondeterministic finite tree automaton, deterministic tree automaton.

Author: SKS

More information

Tree Automata Techniques and Applications page.


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 22 October 2007.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Sandeep Kumar Shukla, "deterministic finite tree automaton", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 22 October 2007. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/determFinitTreeAutom.html