Looking at how this algorithm works stimulate a DFA. So create a DFA for this algorithm

The following is the algorithm to simulate DFA. Algorithm 1: Simulate DFA (dragon book p. 151) Input: An input string x, a DFA with start state so, accepting states F. Output: "yes" if D accepts x, "no" otherwise. while (c-nextChar())-eof do l move(s.c) end if sE F then | return "yes" end return "no"; The following is the algorithm to simulate DFA. Algorithm 1: Simulate DFA (dragon book p. 151) Input: An input string x, a DFA with start state so, accepting states F. Output: "yes" if D accepts x, "no" otherwise. while (c-nextChar())-eof do l move(s.c) end if sE F then | return "yes" end return "no