Denote $S_n$ as set of all strings of length $n$ with elements from 4 symbol alphabet [A,G,T,C].
I have Markov Chain that picks one element in previous string $s_i$ uniformly and changes it to uniformly picked letter from alphabet.
How can i prove that limiting distribution of this chain will be uniform distribution from $S_n$?