Is this correct : whether or not a type 3 grammar generates $\Sigma^*$ is not c.e
To see if a type 3 grammar (regular) generates $\Sigma^*$ just build the minimal DFA accepting the language, and check if it is just initial = final state, with loop on all symbols. All constructions involved are effective.