[recursive languages]

13.1 Let M be an FA and q some state of M. Call q a useful state if the (M, q) :q exists some input w such that M actually enters q. Let B a useful state of M). Show that B is recursive. . 1 1.1 htho Tis infinite or not