Y Fujishige, Y Tsujimaru,
S Inenaga,
H Bannai… - Theoretical Computer …, 2023 - Elsevier
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 paper, we show …