2 ms·
Deterministic acyclic finite state automata. Essentially a compressed trie. Significantly more memory efficient for real world dictionaries. https://en.wikip
by Arainach 4y ago
Deterministic acyclic finite state automata. Essentially a compressed trie. Significantly more memory efficient for real world dictionaries.
https://en.wikipedia.org/wiki/Deterministic_acyclic_finite_state_automaton https://en.wikipedia.org/wiki/Deterministic_acyclic_finite_s...