Skip to content
Related Articles

Related Articles

UGC-NET | UGC NET CS 2014 Dec – III | Question 62
  • Last Updated : 28 Jun, 2018



Match the following:

List – IList – II
(a) Context free grammar(i)Linear bounded automaton
(b) Regular grammar(ii) Pushdown automaton
(c)Context sensitive grammar(iii) Turing machine
(d)Unrestricted grammar(iv)Deterministic finite automaton


codes:

(a)(b)(c)(d)
(A)(ii)(iv)(iii)(i)
(B)(ii)(iv)(i)(iii)
(C)(iv)(i)(ii)(iii)
(4)(i)(iv)(iii(ii)



(A) (A)
(B) (B)
(C) (C)
(D) (D)


Answer: (B)

Explanation:

  • Context free grammar can be recognized using Push down automatan.
  • Regular grammar can be recognized using Deterministic finite automaton
  • Context sensitive grammar can be recognized using Linear bounded automaton.
  • Unrestricted grammar can be recognized using Turing machine

    So, option (B) is correct.

    Quiz of this Question

    My Personal Notes arrow_drop_up
  • Recommended Articles
    Page :