Subject: Theory of Automata and Formal Language Subject Code: NCS-402 Lecture No: 05 TOPICS: 1. Equivalence of NFA and DFA e 2. Examples REFERENCES: 1-Hopcroft, Ullman, “Introduction to Automata Theory, Languages BOOKS: and Computation”, Pearson Education, 2. Peter Linz, "An Introduction to Formal Language and Automata’ Narosa Publishing house. 3. K.L-P. Mishra and N.Chandrasekaran, “Theory of Computer Science: Automata, Languages and Computation”, PHI. Learning Private Limited, Delhi India, @ VIDEO LECTURE: 1. Theory of Computation by ProfSomenath Biswas NPTEL KEYWORDS: Equivalence, NFA, DFA.V y j) Te Eqeiveben eh ywvellence of! Bea Land WSFA! - Vieleo Leche 2 , 4 i ——s (DA DFA Con sirowlacfe. KE behavionr of NFA CIA Ober words, a DFA (Q, eS S 81s, F). Gan ba viewed oh én NBFA GOR, £, $'s aE \ defn ty ine Slty,a) -£5(%,a)} - wy Any NDFA is & more gener, Bee python being more powerful Qe Caeted, a, oletesranishe atitoreden typivelont te @ een « (fuss), Soh, 8, eee) fobame, 5 is lapinel by its stole table - Coy For the clefesminishe cutorreaten pd oe! ie (ws iy (Ve) 18 the Initio stele ; i (6) [0] and [oN] Gretha finol stoles as ae Hee only Stole Conferining Yo 7 onal (iv &* cbe-fined by the Sloe doble (1) the stoles ove subsets of Pe V4 128, (be), [vo Gi],QR K ) QS Ein a deterministic. acceptor ayuivelont te oss me (fteuV}, Sab}, S, vo, 4) rshere 9 1s Os ge by fable és & Sol!” The cleterminishe outomaten MM, equivalon|r Ns q) Vi okefined as follows : Vol F efor; fa,6f 8) £ 1 6) whine 6 Fern], Dorel, Lei Wel, Mot 7)ay, : 83 Construch a clelerminish'e finite puchomaton a equivelenrt to 102 (€%0,%, UL, Va}, forth, § Vor fus4) col? ub 2h Ye VY), Ver %34 Then the glefexminishe pudoraden 11, eyatvalonk te Pt rs giver by 2 C28, fa.0}, &, (re), F) where F Consists of! Fie [Les] [vote £437, [a Us). Brose Mf fe, ter baf, (Me As) ots ets) b& 5 is defined by the Stok table . Ye, 1%) beaded As]R3Q:- wnwert Hre following NFA bo DFAL “a oO on J ey OK i & 7 ™ Bl" Enitiolly, we hove ¥, as rs Stoxhing state Stor stele as\\Eve) Mow, S(Cin) 0) < fo, Vi] (9 GD Again, — S(tven,1) = Ff ‘ re Create new state as’ so create Agen fox tee verkex Plodi) oma Anh 0, g(Bud 0) = Sv) VEC Dg 2 PV V ¢ | 2 fvo.%J k §(¢00.u,1) 2 Slr!) v 8(%) 2 ug v {eome = fro MfFOP SEBO Now, for vertex [1] $(B1,0) 74% S47 1) + Fe, V4 if Finely, dye verker [ta] ovrd fu] Conboins the final stole &Y, of NFA so dhe ove Pinal stoler i ppuivalenl- BFA. Thus, tre equiveloah DEA 1s fe a € t cé)) Q:- Convert fre following NFA to is ayrivelont DEAR (}2 ° ib). Sel’ Dartinlly, My as tre shvting clade, so S(Be) 0) = $0, Auf Sve), ) ie fof AF +S Ceti), 0) = Lw.9) vy, 2 2 $0iU 4 vedo} 2 £%,U] S(Creu).1) 2 S(rerI) Vv SC) 2 pupuius 2 fur, nF So, now stole 1s Oy. %) for verleY YW, S(w10) 7 # slvert) = Lot} when (Ur Ve) , i eee 2 (m0) u Sl 2) 2 fol vis 2 $%o4 g (fuel 2 S(wny Sr) 2 fui} U $% rb 2 §%0,%, 4aX Delesmine a dA from fhe pr WFAA, yobose stote drole ‘ degra 's ren heloury R22 gy Consider yu following NEA: p42 J E0975] fa,0} 8, PEv5}} where § /s oe GS * Constuct on equivalent DFA:+ Constuck o DFA accepting oll strings over fa, e) % a a,