MCQ IN COMPUTER SCIENCE & ENGINEERING

COMPUTER SCIENCE AND ENGINEERING

THEORY OF COMPUTATION

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The class of recursively ennumerable language is known as:
A
Turing Class
B
Recursive Languages
C
Universal Languages
D
RE
Explanation: 

Detailed explanation-1: -Recursively enumerable languages are known as type-0 languages in the Chomsky hierarchy of formal languages. All regular, context-free, context-sensitive and recursive languages are recursively enumerable. The class of all recursively enumerable languages is called RE.

Detailed explanation-2: -Explanation: RE or recursively enumerable is only called the class of recursively enumerable language.

Detailed explanation-3: -A language is recursive if it is the set of strings accepted by some TM that halts on every input. For example, any regular language is recursive.

Detailed explanation-4: -Recursive Enumerable Language A language L is recursively enumerable if L is the set of strings accepted by some TM. If w ∈ L then a TM halts in a final state, If w ∉ L then a TM halts in a non-final state or loops forever.

Detailed explanation-5: -Recursion is the repeated sequential use of a particular type of linguistic element or grammatical structure. Another way to describe recursion is linguistic recursion. More simply, recursion has also been described as the ability to place one component inside another component of the same kind.

There is 1 question to complete.