If a string S is accepted by a finite state automaton, S=s1s2s3 sn where si and there exists a sequence of states r0, r1, r2 rn such that (r(i), si+1) =ri+1 for each 0, 1, n-1, then r(n) is:

If a string S is accepted by a finite state automaton, S=s1s2s3 sn wh

1.	If a string S is accepted by a finite state automaton, S=s₁s₂s₃ s_n where s_i and there exists a sequence of states r0, r1, r2 rn such that (r(i), s_i+1) =r_i+1 for each 0, 1, n-1, then r(n) is:
A.	initial state
B.	transition symbol
C.	accepting state
D.	intermediate state
Answer» D. intermediate state