Open In App

UGC-NET | UGC NET CS 2014 Dec – III | Question 62



Match the following:



List – I List – 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)

Article Tags :