(definition)
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
Tree Automata Techniques and Applications page.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 22 October 2007.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Sandeep Kumar Shukla, "nondeterministic finite tree automaton", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 22 October 2007. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/nondetermFiniteTreeAutom.html
