Posted by **Steve ** on Thursday, May 9, 2013 at 8:24am.

Prove by induction on all positive integer k that if m is any ordinary nfa with k states, and m has fewer than k - 1 transitions, then there exists a state of m that is not reachable.

Let N be the λ-NFA: "L" for "λ"

b

>(1) -----> ((2))

| ^. |

b| | L. | a

V |. V

(3) <------ (4)

L

Prove by induction for all natural number I that the string b(ab)^i is in the language L(N)

## Answer this Question

## Related Questions

- discrete math - 1)prove that if x is rational and x not equal to 0, then 1/x is ...
- Discrete Math - 1. Assume that n is a positive integer. Use the proof by ...
- computer sciece(Computation Theory) - Find the error in the following proof that...
- Math - Mathematical Induction - 3. Prove by induction that∑_(r=1)^n▒...
- Mathematical induction. I'm stuck. So far I have.. - For all integers n ≥ ...
- Calculus - Use mathematical induction to prove that the statement holds for all ...
- discrete math - Could someone help me with this induction proof. I know its true...
- AP Calc - Use mathematical induction to prove that the statement holds for all ...
- pre calc - Use mathematical induction to prove that the statement is true for ...
- pre calc - Use mathematical induction to prove that the statement is true for ...

More Related Questions