That’s correct. https://en.wikipedia.org/wiki/Directed_acyclic_word_graph https://en.wikipedia.org/wiki/Directed_acyclic_word_graph links it to Deterministic ac

That’s correct. https://en.wikipedia.org/wiki/Directed_acyclic_word_graph https://en.wikipedia.org/wiki/Directed_acyclic_word_graph links it to Deterministic acyclic finite state automaton (https://en.wikipedia.org/wiki/Deterministic_acyclic_finite_state_automaton https://en.wikipedia.org/wiki/Deterministic_acyclic_finite_s...) I guess a strategy for compressing a word set could be to compile a regular expression recognizing it using a good regex engine and to then construct a compact representation of the resulting automaton.