Monday 1 June 2015

Q39,Paper 3, J13. Match the following :



a. Context sensitive language       i. Deterministic  finite automation
b. Regular grammar                      ii. Recursive enumerable
c. Context free grammar               iii. Recursive language
d. Unrestricted grammar               iv. Pushdown automation



Codes :
       a b c d
(A) ii i iv iii
(B) iii iv i ii
(C) iii i iv ii
(D) ii iv i ii
Answer C.

No comments:

Post a Comment

Note: only a member of this blog may post a comment.