MCQOPTIONS
Saved Bookmarks
| 1. |
Fill in the blank in terms of p, where p is the maximum string length in L.Statement: Finite languages trivially satisfy the pumping lemma by having n = ______ |
| A. | p*1 |
| B. | p+1 |
| C. | p-1 |
| D. | None of the mentioned |
| Answer» C. p-1 | |