Lecture 8 From NFA to Regular Language

Induction on k= # of states other than initial and final states K=0 a a* b a c d c*a(d+bc*a)*

k > 1 c a b d e ac*e bc*d bc*e ac*d

Example (0+10)*0(1+10(0+10)*0)* (0+10)* (1+10)*0 1 How to get in the final state? Cycles at the final state. Why?

Example ε ε (0+10)*0(1+10(0+10)*0)* + 0*(1+01*1)(00*(1+01*1))* Solution 1

ε ε 0 0 ε 01* 1+01*1 01*+(1+01*1) 0+(1+01*1)0 (0+(1+01*1)0)*(01*+1+01*1) Solution 2

ε ε 0+10 ( *10)*(1+01*(ε+1)) Solution 3 1 ε * *(ε+1) Different ways may give different regular expressions for the same language.

Theorem A language is regular if and only if it can be accepted by an NFA if and only if it can be accepted by a DFA.

Closure Properties If A is regular, so is its complement A. If A and B are regular, then A∩B, A\B, A U B, AB are regular.

Quotient L 1 /L 2 = {x | there exists y in L 2 s.t. xy in L 1 } If L 1 is regular, so is L 1 /L 2. L 1 =L(M), M=(Q,Σ,δ,s,F) L 1 /L 2 = L(M’), M’ = (Q,Σ,δ,s, F’) where F’={q in Q | there exists y in L 2 s.t. δ(q,y) in F}

Example L 1 = L(M) L 2 = 0*1+0*11