MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
Pumping lemma for context-free languages states:Let L be an infinite context free language. Then there exists some positive integer m such that any w ? L with |w| = m can be decomposed asw = uv xy Z with |vxy| _________and |vy| _________ such that uvz xyzZ ? L for all z = 0, 1, 2, ....... . |
| A. | = m, = 1 |
| B. | = m, = 1 |
| C. | = m, = 1 |
| D. | = m, = 1 |
| Answer» E. | |