If I have the input string as 00 for this diagram, will I ever go to q3 or once I reach to q2, that state would be accepted so no matter the input string, once the state is accepted, will I never be able to reach another state 
$\begingroup$
$\endgroup$
1
-
$\begingroup$ The machine continues until the last input is received (and processed). Only at that point is it relevant whether a state is accepting or not: if the state the machine ends in is accepting, the input is accepted. Otherwise, no. $\endgroup$– riciJan 22 at 23:53
Add a comment
|