Thursday

September 18, 2014

September 18, 2014

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

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)

- Computer proof -
**Steve**, Thursday, May 9, 2013 at 8:39amThe 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)

**Answer this Question**

**Related Questions**

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▒...

discrete math - Could someone help me with this induction proof. I know its true...

Calculus - Use mathematical induction to prove that the statement holds for all ...

AP Calc - Use mathematical induction to prove that the statement holds for all ...

discrete math - 1)prove that if x is rational and x not equal to 0, then 1/x is ...

math induction - prove the product of 4 consecutive integers is always divisible...

Algebra II - In an induction proof of the statement 4+7+10+...+(3n-1)=n(3n+5)/2 ...

Discrete Math - Could someone help me with this induction proof. I know its true...