NIST

NFTA

(definition)

Definition: See nondeterministic finite tree automaton.

Author: SKS


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 Tue May 6 13:48:56 2014.

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