Hi,
I saw couple of questions from previous year questions papers and final exercise sheet, where it is asked to compute reachable states/dead ends symbolically. However, when I went through exercise sheet and slides, I could find the ways to find predecessor/successors only through symbolically not the deadends/reachable states. I am not sure if I have missed them somehow. Could you please let me know the steps to obtain the same?