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.

Question

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 1

The graph did not come out but it is a square with b from >(1) -> ((2)) and >(1) -> (3) and L from (4) -> (3) and (3) -> >(1) and a from ((2)) -> (4)