A is a set of all < M > that M is a TM halt on all input strings w such that w <= q(M) where q(M) is the number of states in M.

Is A semidecidable? Is a complement of A semidecidable?

I think both are not semi-decidable. But I'm not sure how to prove it.