Prove that if the number of states is a finite k and state i is accessible from

Question:

Prove that if the number of states is a finite k and state i is accessible from state j, then it is accessible in k−1 or a less number of steps.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: