[Solved]Let M Nfa K States Prove L M L M Contains String Length K Hint Think Possibilities Path Le Q37141654

Let M be a NFA with k states.

(a) Prove that, if L(m) ̸= ∅, then L(M) contains a string oflength at most k (HINT: think about the possibilities for pathlength in M, keeping in mind the Pigeonhole Principle.)

(b) Show that, even if L(m) ̸= ∅, it is not necessarily the casethat L(M) has a string of length at most k.

Expert Answer

---

Answer to Let M be a NFA with k states. (a) Prove that, if L(m) ̸= ∅, then L(M) contains a string of length at most k (HINT: th… . . .