We consider a Markov chain that iteratively generates a sequence of random finite words in such a way that the nth word is uniformly distributed over the set of words of length 2n in which n letters are a and n letters are b: at each step an a and a b are shuf... ...

请注册登录后继续浏览