Scribd
Upload
3K views29 pages

TOC-UNIT - 1 (Written Notes)

Theory Of Computaion

Uploaded by

projectdemo969
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
3K views29 pages

TOC-UNIT - 1 (Written Notes)

Theory Of Computaion

Uploaded by

projectdemo969
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 29
of abstract machina and 1 can be solved wating a Tis is the ahidy the compuctahiin problems thee these machinu \ y The abstract’ Aim : +o develop auctomarte theory olescribe ¥ analyse the aynanate Optone # Automaton consizs of 4 Gata auprescnted in at Trans iktions Aepresented « Automata 2 arkind of machine vohtoh fakes ang no ed shings as Anput & Aids (uput qe Hireaugyh & inet : es of stata, A see the accept stake/final state ce | An cuutomatou suljinilc We: Of Atetes Lsicaltecls’ Finite Gucruatrer | ourtoractiy | machine KK Called the automata ts tb olevelop metheds to behavtovr et Maceti Stat 4 thansistrous cPvcles fy arrows & Scanned with OKEN Scanner [ ce Alphabets frette seb of eae denoted by Z > we a £2 fo,b3 2-{4,B, ad a fice collection of Aqeobols -frema éyrbels of finite | Gea: = eeuers of lengt- aoe his densteel byw a 3 £afed] various the Mo: of Symbols tu a String’ w is called tre beng th of, te end _ EK Acute by ll z bs eg. lolol © Prote Abiing.- Barbe ftw bi © scanned with OKEN Scanner Alas vol aie of att abiinge tect ebb, cbbb, chebbh, ...§. Pnfeinite lavage is { iamice ,.Cac. ) Computational Conpler ty Da measure of te ameunt of, computig Chme 4+ apace) thee & Particular alge. Consumes colon Ur AUN: ee conplerity , that wstN tHe cole . hoo fast the Lb vot | REBOUL re re ase i before voriting & hoo much TUme” allows to prectick i ere boll Aun Aaquine Finite x caled FA: Dafiuittor of FAS Al finite Gabpmata 4 & @uturuple (5-tuple) (9, 2, 694 FD — QH futle set a} alates 2h qurtometa (FAD ot fiate state Machitne CREM) Au automata wot fruit neo oy tales is © scanned with OKEN Scanner end «witti ‘0’ Jus asjedid _acceptid ouly when tee tring A ere ‘9c’ Bb accepted x Sq,s x) =p for some pint outs {tm efx | 8€qo%) ¥5 4 FY rors state Ty dhe abone ‘kandiion Afagcam , uf} ahings Langage capone oh" by FA M=(@,25040F) Se The language accepted bad volitch is denatid by euds coith '1’ © Scanned with OKEN Scanner Ale ing ‘lolol | hese. Ow NY x a ye XG % qinald -' Motol im LCM) © Scanned with OKEN Scanner . exe 22 a. E SC > : “ae Sar from 4.” Fo : 4, — will | dart clate (@q,¢ @ Bera le ale CR ate) Lal is the Tapa symbel, ys state 4 ; ch thak Here is : \prastate 4u ay 4 tek f F © Scanned with OKEN Scanner + ¥ port with ‘oF. O10, OD Pre ae aa ating tat 103 po, 000; Ol) OP! 28" \ o,' Sy Ip ating. Bol ° ©, / \n/ BB moO Ba) Cstost * ol drelougs fe the be cud iT a a ee Nf «Sagopa not belouge te ta L. & Scanned with OKEN Scanner L-foeo, 01,10, 3 (a) o,! Oo O20" sthet accep aug ahing eee face thot doe not _Couteuin “the shing aabb! tu 2 -fab} CD Lt os coustruct o DEA that Aceept alt shingsouer ; i Abing! cab fait farb3 that contains tre “4 al : fi a_>(B) s (2A) b Ee b a >, flip tra silcite. te vuake fiualstate as mou Aale as dehal state | o,b © Comstmet a DPA over fo,b] von -$t © Scanned with OKEN Scanner even “2: of o's + © Design Fa with Befos!} accepis eyen Wo: of us wut B-fon} sot acceps mea oc tite end) © Design ¢ FA covsenitiine ols (uot neces ay © Scanned with OKEN Scanner of onal we the DPA with Aa trans tstiou rove Anis tans éstioo Aiagariate Clee The ahings gensrated 1,100, ON, © ©lo .10> peor ery loo" Ly is fed by the alatemant that © Ae of bas & ae "i ings Of, ds and I's coutatncng odd “o- of |'s"- | suas | Non — Deterministic Finite Automata (wee) be fu Several statis actouce . | | | . Dane apes by B-tuple M=C@, 2,5,40.") ; ig ute Aet of Cuteaned + tale 2 occ a oh tp Ae - qo- Shut stake (4 € F final stale CF se) where © scanned with OKEN Scanner TH A= (0% yee ten gut (q.%) OF #43 ri ahi ngs w iv 3* such Alate - LCA) = in, Lewy i+ the Act 8 (qn) Corrbaine atlost 2 aaa - with a omy of ey do aepresert Ses Pactra a. Atop AM © Scanned with OKEN Scanner me top ciccopod by the nA Piven er diagram relow » Pind tee Language . 3) D2 2-® the longuoge accepted loy tha NIHR L=fa3} |® Aheo obtafy an NFA fo a Language consisting of alt shings over fo, 1] Gay hing Ahould onl tu ad | ‘7 gn Aird pasitien from the enc cb) peacening a © Scanned with OKEN Scanner aul shings ates ting with 19 over a Nea for this Lenguaye. an eS" Avat ends voith 13 over [ef gt of au shinies : Be viet en Thus Lanqaoge 4oe the Language thet accep fete 08 af atl ahings at teniin Vor Joner Fruct the NEA for Hee Language 2 9. © Scanned with OKEN Scanner ope that accept au i" PA the La ee i one 2={ 0,1) that starts wie* 10’ w ; ®) ‘a pe (© Conshuct a FA fos the ua, language that get). £ dof langte 7 acceps, att hings ove PO, Z- fol L= fee, ob lo, a? e 2) LS (1) Constuct a nFA-L={ st > end ust J aap NFA. Non Detirnminiate Finite automata 2 Can Use empty Shon. trans ishou. 4 ti aut abs rid that TE easia to Lonshuck. © Scanned with OKEN Scanner Le DPA Acquine roore space © Deas state roy he Aequited . oS: RxEP@ be. rev possible slate belongs 4o@ « Eptilon roove Alloured in DFA NFA f a state 4 Tnpat syroeet os aguments but Actors sero, Ao Are State - lay C2de3) >2* Qe o eo 4 Fase = 190308. “ y NPA to DFA. 4s tite WPA a ats nection NEA. () NPA Aequises less space than DFA. Dead sat Bnet Acquired. 0 &: Xs pot Le net possibh. State belongs te» pouses st AQ. Epatlen roone % allowed in Jen 2 Der Al The hansis-fon function ett! oxactty one £tate QXZ-—>@& | ES" C (4,50) 1225 oval oD Anak ends with ‘0 a. hargenyt © scanned with OKEN Scanner Note: Convetstou Of NEA te DAA fs clone ing Subset lonstucten Method | a ow O@ © scanned with OKEN Scanner — NA t DFA. ever (05!) that enols with 17} © scanned with OKEN Scanner oul dha in which Conshict the NFA. Pe ae Leon Ladd DEA ond Jast reel, Le! IL, Lo, We, tLt, mid Slept dransistion ali m_dpx NEA ae oO 026 top>: dransistou “lable fev NFA ; | © Scanned with OKEN Scanner © Scanned with OKEN Scanner Na Pe ‘ HoT oa ~fenite automata having zero, ou OF Ae bLran ove moves “fiom 4 Ge atte ona Giver th feb Symbet. + €-NFA i the NFA cohich couctains ePsilou movers) Of Natl em ouas E-NEA sii possible wea, that an_NFA ts Allowec| +e cnake transis Frou Spon taneously » voithout aceaiving fuput syeobet a Thu move 2% called E-move «this € sepresen i. on runt ber of tureet Def iniliow s-nen & formal Notedioa ci E-NPA. g-NPA Can be aopresenticl by. fee Gh, 2) O.%0> FJ hase 5 hos theasgument A in Stak © scanned with OKEN Scanner : Cs b ye GH) €-clesine (0,) = £40» Ud (diy E- closure (4,)= $4,425 Git) €-closue Cg.) = $4,} €- closume of a slat a, fe fevolin cusy Shak that can be Acached feom Ce abot Bey peth Biren tren ous all Aabelted € E-NFA peg °4 aap €= (8,2, 540 P) The language i CeY ={| te da le at take the Slag,u) OF +04 E is dhe tet of storgs deat Ghat te atbost A. accepting © scanned with OKEN Scanner ceecleins GB) = fa. Aas E-clesue Cy) = TO +953 e- closets, = £%] Slap Transirtion table jor DPA - © Scanned with OKEN Scanner Dakat stake Wid des the 2 Cag) = Fon treat tll Ped ce Gert Blab fer DEA Pacis, 0) = & cleus (S¢( {48,435 .4)) = &-ctaun(Ge (Sad av (Se Cf3,09)Y (6. (43,9) = E-cleswe C4) ~closuce ee = {4,443 . | He Teanate-tou aliagren for DFA - ¢ Qe Oe te MEBLY MACHINE MooRE MACHINE - a. © Scanned with OKEN Scanner ER fet tt atv, tug the machine: Genctn 2 Tred output ou wtle presenrt Current iu pet symbol Formal theorem: The mealy roachine wa b~Luple machine (@, 4, % 24,84) a> he Set nf slates 42 ‘cat of émpet a tphabets 4, initial state hs set ef output alates alplobsts I 5 treansichin fonction OX2 9 ps eosin occtpet function exe © Scanned with OKEN Scanner ; ava ° Ove Ayo: fee tly ee jnpet Ze fo] eon A= fabs. y= OColO > input ce Destination | output Derhoates stale oro at 0 | She a, b 40 a mak bd a te oe < pe © Scanned with OKEN Scanner sfonever the Aequren ce ORs au ‘fp Jinan Ae & Scanned with OKEN Scanner ldeion Feble_ pox “Mee Shows machine: © Scanned with OKEN Scanner Fs es roach a b-tuple machine (8, 2; For A, SD @: wet of Atetéc 5. Bet rm dupe de" twithed state A - set of outpad Anti 3: dransiettou qunctiou QxZ>e D+ ocdput -fenckon YA Note: tras exctput fenchou means thet for event Stale ay expat coaseaponcing ovlput asseciated E alphabets © Scanned with OKEN Scanner 5 | Applications =f Finite Automata CFA) | ae Usecd tu text eclitone we * olestg ring Lexical analyse af a oT a ¥ ¥ Lesiguing edits comb tnaitio of paaly m chines. Sequential Circe Ca Mealy R mooae ma + ~ the troplementation of spell checkers . een parse tet te extract thforerertion 2 shucture. data 7 Limitotsus oh Faunce Acdomata ! count findle ou can only

You might also like