|
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
(D) i iv iii ii
Answer B.
No comments:
Post a Comment
Note: only a member of this blog may post a comment.