(definition)
Definition: The smallest automaton accepting all suffixes of a string. The states form a directed acyclic word graph or DAWG.
See also compact DAWG.
Note: From Algorithms and Theory of Computation Handbook, page 11-26, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:08:05 2004.
HTML page formatted Wed Oct 26 09:48:14 2005.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "suffix automaton", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/suffixautmtn.html
