DEC: Decidable

RE - DEC: Recognizable but not decidable

Re: Recognizable

For each of the two given languages state whether it is in DEC, RE- DEC, or not in RE. Prove your claims. (a) L = {(M) M does not accept any string ending in 0}. (b) L, = {(M,,M)| at least one of M, M, accepts the empty string e}. For each of the two given languages state whether it is in DEC, RE- DEC, or not in RE. Prove your claims. (a) L = {(M) M does not accept any string ending in 0}. (b) L, = {(M,,M)| at least one of M, M, accepts the empty string e}