(definition)
Definition: See deterministic finite tree automaton.
Author: SKS
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 22 October 2007.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Sandeep Kumar Shukla, "DFTA", 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/dfta.html
