Top Qs
Timeline
Chat
Perspective
Directed acyclic word graph
Topics referred to by the same term From Wikipedia, the free encyclopedia
Remove ads
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
Remove ads
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads