When the current character is not accepted by the current state, a transition is made to the reject state. How is this implemented?
last statement is:
else state = reject ;
is reached when all the preceding
have a false condition.
It causes a state transition to the reject state.
When this happens,
the current character is not accepted
by the current state and
the string is rejected by the automaton.
state is 1 and
current is 'm'.
Does the following evaluate to true
( state==1 && current >= 'a' && current <= 'y')