There is this proof:
M = (Q,S,R,f,g). where Q is the set of states, S input alphabet, R output alphabet, f state transition function Q X S => Q, g output funtion Q => R
Suppose that q1, q2 are two states in FSM.
Then q1 is k+1 equivalent to q2 if and only if:
1. q1 is k equivalent to q2, and
2. for every a in S, f(q1,a) is k equivalent to f(q2,a)
I know how to prove it. but I need to prove the converse of it. Thanks.