Match the following: Item Grammar Match Automaton (i) Regular Grammar (a)…

PYQ UGC NET 2012

Match the following:

Item

Grammar

Match

Automaton

(i)

Regular Grammar

(a)

Pushdown automaton

(ii)

Context free Grammar

(b)

Linear bounded automaton

(iii)

Unrestricted Grammar

(c)

Deterministic finite automaton

(iv)

Context Sensitive Grammar

(d)

Turing machine

Choose the option that gives the matching automaton for (i), (ii), (iii) and (iv), in that order.

  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 39 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…