Question

Define recursive and recursively enumerable languages

Answer 1

recursive is also known as type-0 language generated from type-0 grammer.an RE language can be accepted or recognised by turing machine which means it will enter into final state for the string of language and may or may not enter into rejection state for the string which are not part of the language.it means TM can loop foreverfor the strings which are not a part of the language.RE language are also known as Turing Recognizable language.