Sum over binary words of length $k$.

49 Views Asked by At

Let $w$ be a word of length $k$ on binary alphabet$\{0,1\}$ with $p(0)=p$, $p(1)=q$, and $p>q$. How would you calculate this sum? (exact or up to the first order) $$\sum_{w,w^{'}}(p(w)+p(w^{'})-p(w)p(w^{'}))^{-s}$$

Where $s$ is a complex number.