Definition: See nondeterministic finite tree automaton.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 22 October 2007.
HTML page formatted Tue Feb 12 10:57:43 2019.
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: https://www.nist.gov/dads/HTML/nfta.html