Directed acyclic word graph

From Wikipedia, the free encyclopedia

Directed acyclic word graph (DAWG) may refer to two related, but distinct, automata constructions in computer science: