UTpaper

Free mock tests & test series

Question 118Asked in BEL PE Computer Science, 20 Dec 2025 (5:00 PM)

Which of the following correctly matches a grammar type with its corresponding language and accepting device in the Chomsky Hierarchy?

  1. AType 0 — Recursively Enumerable Grammar — Linear Bounded Automaton
  2. BType 2 — Context-Free Grammar — Turing Machine
  3. CType 3 — Regular Grammar — Finite Automaton
  4. DType 1 — Context-Sensitive Grammar — Pushdown Automaton
Show answerHide answer

Correct answer: (C) Type 3 — Regular Grammar — Finite Automaton

From BEL PE Computer Science PYQ, 20 Dec 2025 (5:00 PM)

This is question 118 of BEL PE Computer Science PYQ, 20 Dec 2025 (5:00 PM). 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.