3 ms·
By that logic the app I work on would have a DFA with ~200,000 nodes. That sounds fairly large to me. That's not very large, since you can store a DFA very com
by danieldk 12y ago
By that logic the app I work on would have a DFA with ~200,000 nodes. That sounds fairly large to me.
That's not very large, since you can store a DFA very compactly in a table (C array with structs). The table stores the transitions, which only have the character and the target state. Then you either keep an array with state offsets in the transition table, or you modify transition tables such that each transition points at the first transition of the target state.