$Q=\left(\begin{matrix} -2 & 1 & 1 & 0 \\ 1 & -3 & 1 & 1 \\ 2 & 2 & -4 & 0 \\ 1 & 2 & 3 &-6 \end{matrix} \right)$
In the state space ${1, 2, 3, 4}$, find the long-term probability of visiting state 3, for the chain starting in state 2.
I understand the idea should involve making state 3 an absorbing state, but I'm not quite sure how to do that for a CTMC. My textbook offers that if $q_i=0$ for some i, then i is an absorbing state, where $q_i$ refers to the entry [3,3], for state 3. But if I make it 0, I can neither exponentiate to find a stationary distribution nor find the inverse of the negative matrix, V=$-P^-1$, and do rowsums.