When we talk about DFA, we say that each new character from the input requires one memory access. What does that mean? This is what I think about this. Please tell me is this right? For example, I have a transition table stored for a certain regular expression in memory (RAM). Now, for each input character the CPU will fetch the whole transition table to find out the next state. In this way, we have just one memory access?
DFA memory bandwidth
automata;finite automata;memory access