Given the data set
I have to find the connectivity relation $R^\infty$ and write it as a Boolean matrix.
I've found the connectivity relation to be \begin{align*} R^\infty = \{ &(A,A), (A,B), (A,C), (A,D), (A,E), (A,F), (A,H), \\[0.5em] &(B,A), (B,B), (B,C), (B,D), (B,E), (B,F), (B,H), \\[0.5em] &(C,A),(C,B),(C,C), (C,D),(C,E),(C,F),(C,H), \\[0.5em] &(D,A),(D,B),(D,C),(D,D),(D,E),(D,F),(D,H), \\[0.5em] &(E,A),(E,B),(E,C),(E,D),(E,E),(E,F),(E,H), \\[0.5em] &(F,A),(F,B),(F,C),(F,D),(F,E),(F,F),(F,H), \\[0.5em] &(G,G),(G,I),(G,J), \\[0.5em] &(H,A),(H,B),(H,C),(H,D),(H,E),(H,F),(H,H), \\[0.5em] &(I,G), (I,I),(I,J), \\[0.5em] &(J,G),(J,I),(J,J) \} \end{align*}
The Boolean matrix will then be
$$M_{R} = \begin{pmatrix} 1 & 1 & 1 & 1 & 1 & 1 & 0 & 1 & 0 & 0 \\[0.5em] 1 & 1 & 1 & 1 & 1 & 1 & 0 & 1 & 0 & 0 \\[0.5em] 1 & 1 & 1 & 1 & 1 & 1 & 0 & 1 & 0 & 0 \\[0.5em] 1 & 1 & 1 & 1 & 1 & 1 & 0 & 1 & 0 & 0 \\[0.5em] 1 & 1 & 1 & 1 & 1 & 1 & 0 & 1 & 0 & 0 \\[0.5em] 1 & 1 & 1 & 1 & 1 & 1 & 0 & 1 & 0 & 0 \\[0.5em] 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 1 & 1 \\[0.5em] 1 & 1 & 1 & 1 & 1 & 1 & 0 & 1 & 0 & 0 \\[0.5em] 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 1 & 1 \\[0.5em] 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 1 & 1 \\[0.5em] \end{pmatrix} $$
I feel like this is wrong though. I would appreciate it if someone could point me in the right direction.