UTpaper

Free mock tests & test series

Question 72Asked in Bihar STET Paper 2 Computer Science (Class 11-12), 12 Sep 2023, Shift 2

According to Chomsky hierarchy, which of the following is recognized by Recursively Enumerable language?

  1. AType 0
  2. BType 1
  3. CType 2
  4. DType 3
Show answerHide answer

Correct answer: (A) Type 0

Explanation

Recursively enumerable languages are Type 0 in the Chomsky hierarchy, generated by unrestricted grammars and recognised by Turing machines.

From Bihar STET Paper 2 Computer Science (Class 11-12) PYQ, 12 Sep 2023, Shift 2

This is question 72 of Bihar STET Paper 2 Computer Science (Class 11-12) PYQ, 12 Sep 2023, Shift 2. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.