Directed acyclic word graph
Directed acyclic word graph (DAWG) may refer to two related, but distinct, automata constructions in computer science:
- Deterministic acyclic finite state automaton, a data structure that represents a finite set of strings
- Suffix automaton, a finite automaton that functions as a suffix index
This disambiguation page lists articles associated with the title Directed acyclic word graph.
If an internal link led you here, you may wish to change the link to point directly to the intended article.
If an internal link led you here, you may wish to change the link to point directly to the intended article.