A set C is called absorbing if P(i,C)=PiC=1, ∀i∈C i.e. the probability of settling into a set C in the long run is 1.
Let {Xi}i=1∞ be a MC. If the state space X does not contain two disjoint s, i.e. A∩B=∅, ∀A,B⊂X where A,B are absorbing sets, then {Xi}i=1∞ is indistinguishable.