

MCQOPTIONS
Saved Bookmarks
1. |
A context free grammar can be recognized bya) Push down automatab) 2 way linearly bounded automatac) Both ( |
A. | Push down automatab) 2 way linearly bounded automatac) Both (a) and ( |
B. | 2 way linearly bounded automata |
C. | Both (a) and (b) |
D. | None of the mentioned |
Answer» D. None of the mentioned | |