(definition)
Definition: See deterministic finite tree automaton.
Author: SKS
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 6 January 2022.
HTML page formatted Wed Oct 30 12:15:30 2024.
Cite this as:
Sandeep Kumar Shukla, "DFTA", 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/dfta.html