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 6 January 2022.
HTML page formatted Thu Jan 6 17:07:56 2022.

Cite this as:
Sandeep Kumar Shukla, "NFTA", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 6 January 2022. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/nfta.html