nondeterministic finite tree automaton


Definition: A nondeterministic 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 NFTA.

See also deterministic finite tree automaton, nondeterministic 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 Wed Mar 13 12:42:46 2019.

Cite this as:
Sandeep Kumar Shukla, "nondeterministic finite tree automaton", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 22 October 2007. (accessed TODAY) Available from: