Given a DFA M that satisfies language A, how do I modify M such that a new language B consisting of all strings that are accepted by M and cause M to enter a specific state r at least once are satisfied by the modified DFA?I try to remember whether state r is visited or not. But as I known, unlike turing machine, DFA does not have any memory.
DFA which visit a specific state at least once
automata;finite automata