Linear-time Computation of DAWGs, Symmetric Indexing Structures, and MAWs for Integer Alphabets

Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga +2

The directed acyclic word graph (DAWG) of a string $y$ of length $n$ is the smallest (partial) DFA which recognizes all suffixes of $y$ with only $O(n)$ nodes and edges. In this pa…