Match the following: (i) Regular Grammar (ii) Context free Grammar (iii)…

2012

Match the following:

(i) Regular Grammar
(ii) Context free Grammar
(iii) Unrestricted Grammar
(iv) Context Sensitive Grammar

(a) Pushdown automation
(b) Linear bounded automation
(c) Deterministic finite automation
(d) Turing machine

Answer: B. c,a,d,b — Match each grammar type to its corresponding automaton based on the Chomsky hierarchy. Regular grammars use Finite Automata, Context-Free use Pushdown…

  1. A.

    c,a,b,d

  2. B.

    c,a,d,b

  3. C.

    c,b,a,d

  4. D.

    c,b,d,a

Attempted by 97 students.

Show answer & explanation

Correct answer: B

Match each grammar type to its corresponding automaton based on the Chomsky hierarchy. Regular grammars use Finite Automata, Context-Free use Pushdown Automata, Context-Sensitive use Linear Bounded Automata, and Unrestricted grammars require Turing Machines. This yields the sequence c, a, d, b.

A video solution is available for this question — log in and enroll to watch it.

Explore the full course: Mppsc Assistant Professor Computer Science Paper 2

Loading lesson…