Re:Game Boy Wordle clone: How to compress 12972 five-letter ...
by Someone on Sunday February 20, 2022 @09:27AM
(#30405955)
That’s correct. 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_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.
Re:Game Boy Wordle clone: How to compress 12972 five-letter ...
by NieDzejkob on Sunday February 20, 2022 @07:20AM
(#30405145)
Yeah, tries are special cases of FSMs, and so are DAWGs.
That sounds like a DAG-shaped FSM to me...? At least I can't spot the difference.