Embed Notice

@shakil_tcs
@cnx

You are right. Hopcroft's book makes it clear that for M to recognize language A, it must be A = L(M). If some language B exist which is proper subset of A, then M will accept all the of the strings of B and some more that are not in B. In that case, we'll not say that M recognizes B.

Thanks for your time!