Consider the alphabet $\mathcal{A} = \{0,1\}$ and consider a finite set of words $W = \{\omega_1, \ldots , \omega_n\}$ over $\mathcal{A}$. Then the renewal system $\Sigma_{W}$ generated by $W$ is formed by bi-infinite concatenations of words of $W$. My first question is, does every renewal system is intrinsically ergodic?

Secondly, is there a one sided version of the definition of renewal subshift?

On the other hand, Adler asked the following question: Is every transitive subshift of finite type topologically conjugated to a renewal system? To the best of my knowledge the conjecture stills open. Is the conjecture open when the alphabet is $\{0,1\}$?

My third question is: Are there any examples of renewal systems $\Sigma_W \subset \mathcal{A}^{\mathbb{Z}}$ that are subshifts of finite type and viceversa?