ean 1 | pefine finite automata mention tne iy : Fi im Auiomodg, Hie Fos] inte xta an ahstwe g de ice J+ ig _g __ Mathematical of a tem _with discrete __inpu | states set of tvongition fram 43a t state that Occur of input ym. Fro _ciphabate ie ashes of — Finite Automata! = 4) | Drev minig ti Finite Automata (CDF A). + | Each input cx ttlas) leads to exactly one State tracanaition ei No null teanaition owe allowed . W)_LNon- Detesminiatic Finite Aulomata (NFA)! - + |Ao ~ anput aymbal can led _t>_auil tiple poagible _gtate _ barans oN ii solic $ AN\ow oull Ce) +ansitions, e- NEA LA Seas Siotlas to NEA ut — includes twanart that do pot wequiwe 4 nput rts — rot] Ba ~~ {really Machine ‘= Output depends on Sl =| a Finite —_ Automatq with _eutpuh f= + Incase Machine i= Output depends only oft usereit State. cwcret. gcite Ko! Symlnol, © scanned with OKEN Scanner2)__| Mention difference between Ah NEA [€ = closure of @) Ta — An DEA : i — ‘DV OFA stat! fax —Detexin-| 1) NFA sa “a Shi = closure of 6 = TS.¢6 iat init _Auiomation |-deeciiinisric A siotation | ation [| % Be € = cloguve of Cr- Fe¥ | DEA can opty li NFA can us ie] j [DEA ca : fy u empty | z : = [atving —tsane\tion, ~"[tzing —asansition "9 [2 = close a ele hp SRP Reape eee WIS ia ime difficult [HDNFA io canker a, [7 |é- Closure oF g- Pa} 7 to Nis uct ‘ons s\ch si _ L 7 4) | vi fferene. sete Mealy & Moore machine | ‘w) [end _atate pony hy iv) Dead gate ia not with @xample 4 abate sisupcata the requintd 7 snequixed [Lot toeaty Machi Machine i i) {Outi depends _an__pae Lola d pan only i 1) [OFA rrequines V)NEA -requixes le duta 06 wel poccett| upon present states |) ni pace pa than DFA input. | 3 0 clnsuce of vey stair in re | in [EE input chonges—ouptlia ¢input change { Follow ing € NFA a ‘change outpub does f't. od A * \fiess no. of Ginle ave iii) one no. of tate i | cquied ove yequired | a € G POM : PAY Vet L iW) | “Trey react Fagte iv They yeack sdower “li, SO. 35 ronal ko iNpub to hprk L ae : ; | —}& mor _atnte empty = _—V)_|Poynehrronos oust: ) Synchranbus out pith {1 € clguve of 4 2-7 F913. 4 sc génexation Astute generation E cloguve of 9 $2,4,5.¢% se T i C clacuve of 9 '- 139.6 | & a @ scanned with OKEN Scanner3 @ scanned with OKEN Scanner= 1_NEA =fo,3\ that ciccepted ql) Conside a Naina, aN \ eet digg give x . ie aE a moore mach Squivalent to Ve. vs a i GQ—- oO 7) if —— == ou = a F 1 a 9 ) Vodn 4 8)| Constauct DEA fox follouling NFA . L | LC G : | > Oo Ay, H ar 30-——= er [Gu-Hi Teangition Diagram of Mogre Mochise-} i a Qua 6 yy —— d O 4 é T Sa A Be A B a at gaa aie Np te C = == = | —Treanaition “Table fae DEA 2G i I ofale Al saclA |B Gate pele py - Tp fe | [sey ere eee a = il TeansisioS — Diaqran) 4 = a ! ee. 4 OY : él Fe | 7 gb = @D - | @ scanned with OKEN Scannerwon yes ‘youvA Assignment 2 f a Distinauigh —petween (Rela ern Wag the 09 las of _fnContent fre bag ee et arequ\ ow language _K Comext _fac0oe leauge a_broades class of | Jang uae that can be zea yeomMze Finite Aut cay _b sail by Pus hdown automata. a Re mata “They can be dee cxihed by WWThey can he deacwibe SJ A Pscqulay _exfpresdions gelendd| CPG's whi have firrodueion boy xequlay “gociManes ules of the form Asx where Aig a non terminal hick is a string of texmind\| Lloro non-tenminads. a i) A_&NEN in) Recog ized by OR which Rec agnized ny DF have av etack 45 keep track Fok additional infaymahion Closed nde unl on inberse jy) Closed rider non concaifiiiinl! onCatenarion & keene _|& keen stax optrdbions buh. chy _opesaiions [nok onder indergechion ' complementation, Examplea' =.S7tring of —_pulaned WV) Examples’ ~ Baha Nice si niha pacontnese: purwothe 4 binaxy 094 ek Nhe © scanned with OKEN Scanner[PL La | hewe 4 i SP ale ena Spins a mje & 2 Grreyinmma: = Ea Lens enon tesmninal oa _canno fns |‘Spe-9 Grammax generate CE) = mul. Bis a ating of terminal | i. Production must be in the form 2 pot= Ferminul | Asay 4 where ACN (Non terminal) 3 | Exatnple® | & N 6 CUNY (ot ring of terminal & 7 Ts ab Noh teeming ls ). = bes ocB | ——“These languages _genexated by 4 ch OB i The! grammars Y ave hn? wecoqnized™ by a a> Oh Cs ol= deterministic pushdown _dutsinaton = | i = id pet Grammar | | Example = hte | pe <1 Gar v qenexnie _consext — senaitive + Languad t The _pornductions mus} be nti» — a4 si { J ig as Pal epee A a Inhee ACH Tita Semanal) X-a py CEB ES = @ scanned with OKEN ScanneraAbbb where EN Chen=texminul) & aep 1 ahh eh (—texminal) ab Bbheb The _ssule _as€ allswed if @ | oh €bheb a Jin Joe: Dol __appeet nthe ighk cide i abbhh of any wale So )-| Show that tye givens grammayy ie 1 Example’ ambigveus grammar, rep bad 36 £3 PFE A > alaY FOE XE s Y 3b ES 0 i 1 Se )| Consider the allow "4 panduchion arule EX E+E > afhB it £5 FRE +E B> ppb 1 ax Ata f Ale . obtain _leftrne Ae rights derivation fox ——— f ring __Sabbh?, v ims ED>ERKE be =aAh— | ofimet Desivabion. St ES E+E &E @ scanned with OKEN Scanner~ 9) | Find the —stsing se —foxr_—followiny expression 1 oo* _—Sol- | oot =0.F€ 600, aaa, = 4 a = $0,00,000,0000,-+++% a a) | gk b* Gale | oR = $04 aaa ...% UPC b bb hhh os = = fob aabh, aaghbh,-~-- % — 2 ee ees be be o,1,00, 1) Jo oy dh 0) Eind the reduced’ axqmmay equiva i Following act MNO athere s Ac /58 2 bhge /q B> ash dbbe - CS Be fad © scanned with OKEN Scanner