Wednesday
September 2, 2015

Homework Help: Computer proof

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

First Name:
School Subject:
Answer:

Related Questions

More Related Questions

Members