b) Recursive Enumerable Language:

The language is said to be Recursive Enumerable if there exists a Turing machine which accepts the
language i.e., it enters into some final state and loops forever for the string which are not part of
language (i.e., it does not enters into some rejecting state instead loops forever).

Recursive Enumerable languages are also called Turing recognizable languages

c) Recursive or Decidable Language:

The language is said to be Recursive if there exists a Turing machine which accepts the language i.e., it
enters into some final state and rejects all the strings which are not part of language (i.e., it enters into
some rejecting state for all the strings which are not part of language).

The relationship between Recursive Enumerable and Recursive languages is shown below:

Recursive Enumerable

Recursive