LAA Corr sem4) ‘Banc Concept Automata Try ee Sombel Siring, Pomel Longa Compu ond eng, Basic Concept and ——— ‘Automata Theory Questions-Anawers Se ‘Lang Anewer Type and Medion Anewer Type Questions ‘Geet ] wat do you understand by term alphabets and string {automata theory ? Explain. oe CONTENTS eee alafajala|>|o|a|% i i E E F J Ist tae, 5 ath a DERG neste, B,C,D, 8, Gl LS2A(COTT Sem) Bani Concept & Automata Theory 2. Allofthe states nS, are equivalent 4. Inthe inte automata there aretwe types of states fina state and nom. final states Hence divide the ac of tate into two parts @, and @, 101. @,= 14.8, D.B,F. 0.10, SUUCIACB, D8. 0, ‘Slats belong to sme suet are equivalent because they ae inthe Same st fr string length 6. States belong to diferent subsets re 1 stingsishabe 1. The C se single stat, hence cannot be divided. Among the tates (A.B, DE, FG, Hi for (BD, F20for input ether Oo, he bet ate trom tol which different subset. So, Spl) tA, BC), D,F) 4 Shmiaey ie die farther, WC, 1 (GB 2, 19. The sats cannot be divided fareher. Hence these are the states of ‘minimised DEA 10, Lath ay tA, Eh (G)—r¢q 1B.» 4y iD. Fray Bt eta sites A este here iia states iA, 12 Final tate wax hence here ial tates (1.12, 13. Thetabulr repesestation of minimized DFA elsls|s “Geo Ta | State and prove Myhill Nerode theorem. amwer “The MyhillNerode Theorem : Lat L2* be a language. The lowing Cireettatemeta ar qual Tet meepuanthtt b= LA for some DEA A Lethe unt seme sf the equvaient clases of right nvariant quiron elation on al strngs taken rom of it inde a. Tatar equivalence relation on be defined by mea besur el, lige ty rl ‘Then, wot ite aden ‘Scanned th ConSconer Scanned with CamScannera seen ernie ayn eo character | tau characterise | a re pe cnstroction of mim one] ‘a 7 Bet ee gam vaidyng eve hows is reaene | gc eon | "This way, the index of R, cannot be greget sabre ti ‘Seine 8 er ght invariant then or every w ¢ aa Soa eg rier of ake ES fan Let on anata a hg gti agian, that means, ae net antes os he dfiion oo qaeig The batch ey Ant th trea sta Bae Fad We BU H Fysllly feed! Retort thine well defined, copoly that i be ene tt the eatin of By, is indopendent of the ehice ‘Peat ft mae cas ly: So we Bane eg , 2) aly, Batt everett eae a ant, therefore hee ech ce ely «el yield 6 etl chw tat = LiAyy), Tis follows trem aie wedi -clnurelig, x) arden? of eres goainpat tdi it Dra yet matinee by the states of Perillo tage The maj agonal aod the upper are epa once leandae" "eres x, 2or0 willbe putin the locations a ent tinh on al atte = ssetrilhenneo th that re Xp, a)ands= 84h, nthe place ofp) ther? LMA (CHT Sem.) asic Concept & Astomata Tory Mr) ie mitherX noe, then 9, willbe ‘4 Rpt and fr inal oat ae ‘Step The combination of atate where theres Othe willbe the ate {he minimised machine ‘Gao TAl | Minimise the automata given below DPA minimization using equivalence theorem: “rans table DFA. ao ‘Lets apply he equvalsce theorem tothe given DPA. Peaesdeh (4.6.0) Blhedene.shn Brie delta. bam Hence, Pie "Thre re three states i the reduced DPA. The reduced DPA is a8 ‘Scanned th ConSconner Scanned with CamScannerre 1A Seng | aint Formal net some ET escmreeo Aa meg aaa Try ut reo ON Se th Sen DAs aren So iid DA Sab | eae) leaopuao | | fe Tn | GATE] inne the fotowing tomate: eras, VERY IMPORTANT QUESTIONS ‘Following questions are very important. These questions ‘maybe caked in your SESSIONALS as well ax What doyou understand by Determiniati Finite Automat (DPA) and how in reprenented? Reterg 15 ‘Design aA which acnpt a of string containing exactly four vin every ring over» eteeQ 18 What de you understand by Non-Determi Automata NANDPA)? How itt represented? Rater 115 Draw DFA of fellewing over 01: [Allsringe wih ven mmber of rand even number of, ‘il stings offen a mont eterg 118 Define NPA. What are various point of difeence between, NPAuna DFA? Refer 121, Convert the fallowing NFA Wy DEA'where te given by 101.8, ge into ‘Scanned th ConSconer Scanned with CamScannerme Bar, 1, Describe Mealy and Moore machines with example. Convet (@7 Detcn Mealy machine as shown in Fig. 1 td Moor Regular Expressions and Languages ‘Simslton sf Tenuta Graph sd Roglar Language HABITS, ‘Scanned th ConSconner Scanned with CamScanner2aAcurT sen, we repr eprestion er en Uno deed by RG in Anesth Chewy LUR,R,) = UR, LR). Bf a Ghote arte eterna rs Sin cape toa eee oweden tne rei a or ee [eS = ae earch techiqns ating any eqoence of lphanumeri characters (ters, suber pate ed puna). Formal recursive deflation af regular expression : ally repli expenion an algebra otation fr characterising setae 1 Any terminals, the bole belong to $ are regular expression all rag nor land ml set (are ala regular expen ‘etular expression then th (repetition or cloeuet) spodtacr ree ¢ Biomater ere ty peated aptationef ne aes rom 102 ver Lara repr rpen Basie Sf era rpuas expe eri nate mmm: ‘WeeBE | bact tedeties orepur epee Taewer_] Two ropa pein Pan @ are quale P= Qf Pan @ 2. Theidenttie frre egraons ae wf fr iiying rear RR CoRR Race RR (rare nger (Pgh = Pgh air gre PRs QR and RP Q)= RP + RQ WeeTE | simpy the eta expresion ir cme WeeRE | Prem the nates a oper expvation prov ht beraeersaeney ‘Scanned th ConSconner Scanned with CamScanner- rn 1" 21701 according to + RABY InsP ear aren, ich consist fs este Sages caine se sree ph gang ame at sate and noe rate raph clecton olin Janeane te DeLee meses sr efthem deine ashe start sate and (Ceca nated al tate 2 Temwrmg nn epneted bya il ie pms Wyte concer ie having an aso ada fea The dngraneait mera. ‘ Asia rate wpa ton wc ie ‘at tata ed cage at sw 0 i mete ite ae edi pci ule ort 4 Renata mp e wert daen trata eyenedes OQ Fer eummpe: — “Tory of Asta & Formal Lanevags Gee, | State and prove Kleene's theorem with example. aaa =] AO ace + ne OO corm Bests step A shown Pig 271 Phe aguas an a any | ‘Scanned th ConSconer Scanned with CamScanner‘Theory of Automat Formal Languages 27A(CSIT Sem) QeeB | For the given languages Ly = 4,2, = and L, (0, 1". Compute Ly. Ly and by by Tnawer byab lye ely2 0,10 hncratation' Union Po Geoze | Lee eceptL*, ioe] ‘The Lincladen stringer = 010,01, 19,1 wO—©. “Soreh 1 (0, 1%; constract NFA with moves that enor PA Mh ren. anh pm hate Pe ad Mnf cept Ul tetrropc Feta, iat eeu repre thereglar met] ava] Draw faite automata recogni (cvirastcowtwel oe mena PaO 9) : TSW S90 sone Tao oo ‘newer eo Sant +197 100 00» an < 7 . | CaO \ Taso Cerone + y* | Pig 27, ‘Scanned th ConSconner Scanned with CamScannereqslar Expressions and Lang eqs expression for thelanguage containing ich there are atleast two occurrences aa wee eeay eoamenes f aroun? esc tat eeD ete ve0 2 vere Ba r= (can o (11) OF | ‘Geil | wete regular expressions for each of the fllowig tangas over the alphabet (1. "Theat fall ering which very pa Before ay par of adjcent oe 4 Theme dstngr on contain 11 as oubstine a 1g tin i p19 my xi ere 1] Seine | cy wr etl ig hn tne ert te | recta aa eo {ice so tne O mst flow aa uringe are ike OOS" | oni Tat oriorer ir of adjacent zor 99P eet] Let, and r, be two ions defi fale r be two regular express Provethar [1 MHMLandry 21 400¢30"1 ‘Theory of Atoms Formal Languages Poa carTsen) Zico, dor, oot, 101001, (G6 10% Pe nent er ra arn, ea Rte ees ae Qeestons-Anawers ‘Long Annwer Type and Medium Anewer Type Questions “Gee | tate prove Aen theorem Hapa ppiation Andes theorem: Lt Pand Qe wo roglar expression over alphabet ‘Pines ot sovain mal rng Thon equation R= @ RP bas unique ‘Biston ven Rear roo: Let cmd the equstion R= Q+ RP aun Patvalue of in equation 2.161) Ra QclQ+RPP aun Putvaloe of Rin euntion 2162, RaQ QP+ Re ‘hen wept the value again and agin we gt theming equation: ReQsahs Qh sgh + RiQuePePaPr {Since +a + RiQP> (By deitiono closure operation for eplar expression ‘Applieation: TP Aden thcre used determine the regular expreson represented 1 tramitin diagram 2. Therearofllowing wspton corresponding t transition diagram “To transition eat should not have ay mare [Rharonty on sarting tte Tho vertes ee getty ty Bs the ela oxprton repeating the net string acepted 1 thetranaion aati othe Gna tate ‘Scanned th ConSconee Scanned with CamScanner| a ee : poss sprains td Langugy, A CO reopen De fg a, ate ot eh lowing set ofan © Setmeees, et, aca in nthe edn feats sot non or ven deers ite ato Fret te reser expression of given FA wing Arey =m arabroaee (asd srs ais8 First salve equation 2153) ‘Accing theorem, B= Qs RP gives R= @P* Newitt asso Now eatin 2.153) yaaeea Ley Newile. 188) Pahl, i Para, ae aires tynenailsis rig hen Sa #400" a0 90840 Qae Regs Paths ab aba) | ' Re Qmcah sabvettn sb sab abate i FA.given below. Wecirecl apply te Andes theorem athe graph doe ot contain ay ll (meer eee the lowing squats Babee eae ‘Tere Now jerelasbibsabjaar 8b +abia ereeponding to given FA By Ards theorem, ‘Avg inly a stat okt Biba a oat ‘Scanned th ConSconer Scanned with CamScannertae eny x 2p2 any seiselee oy any cana 2173) aerate erode a4 {lqineaml ead Deaibal ead Spots Vga adh ad Treat ioe 98001 «at TEES ants 90 at 0 0s ean nd the ale esha tater a quem fice urn cmot te ve “Gernik [fanaa the condition in which two machines, 94M, vid ob equivalent. Show that the following automatas art scr) a 1 Ut wb fate ata ner We constr comes, tal onsiting on + eau, where inthe number o ee ane a ne 2 Metis calma casi emia 3 ‘efitclenacsiatuot pin af vertices ofthe form (a {nthe socon and wabecquentcoluns wich are ae nthe st elu th lements nthe sened and valequen¢ colamne peat hat and Mare oqsrleo "Toi ator in and Marg and, rempecively. ‘Hence, the a em stf t t orin te comperiaon abl mat be vee. aa a faved om) ena [= [ered ‘As qpa final state in ond, noe Gaataein M0 M, and M, are nat talent ‘GaeRt: | From the pvon NFAa decide whether the two accept the 2 Tn Fig 210.0) the NFA acspt all string whichis combination of alphabets rein) ‘Scanned th ConSconner Scanned with CamScannerpega Repression and Langue puaccortsee® de kno ha tang 7 tora atamDeNTAbeSdergae Aan A, eosame sae eSetin Som Saree ng 2108. same language esothegen PAS Rg BIB DET and Non-Regular Languages lonare Properties of Regular Lanauce. on hanes Type and Medium Anwmer Type Questions “FeeTaE Prove tha the lnguage Ly and Ly are closed under Intersection aed complementation if they are regular. ome | Tit erring ten nels nen * ‘tr vordat et oth rer leguge seed under inter, Pry Depa ref yk relat anes hobs Goh) isco ye Veen agra allows Star Pig 220) and Fig 22010) hat hole Gah) oS ‘Bese ye replat and Zpare regular S06 + enue Zo is win (EoT)which means ole® See ole wernt Er) eh ote Pig 220.1, o | Tee odo Frm Lange Conplometaen Lisp tempest ei tore nt {hes frp langue dnd de open te nr der cenit 0. PBODPA Shas Dh eg 2 IaDPAstacopibeadin ithe hese PAu 4 InDPA Mace nt rr tif fi tad tena tains fee ae fad a 4. itil ng emul ened ete sae teen 21SA(CHTT Sem) ginal A altering and octal inp stings tht he Fede cept sings ie i Terre main apes te anguage L-Se, Lea regule agape ‘GueEar | state whether following tatement is true or flee. Justify your answer: TIPE and are non cegular languages then intersetion of lind Mis alse non rela 1 HEL and ae real inmgunge them = eal eglar Aarwer | i we roots Let and M ae to on egress ‘Teotmienectonef Land represented br L WM, By De Mogae law Lal = Eo ‘We know that complement of ne-repalar langage non regsae ‘won of two no tepaa anges ho-eguar. Therlor ToW isnowrepuar. Hore Le mele languge a Te Proot Lyf, IRepice by and by AM Wek that omplient fa regular languages regular ad we le ow hat th itrsction of ro eel anguaes regu ‘Scanned th ConSconner Scanned with CamScannerpreaion and Langage ee ‘Theory Avtomata& Formal Languages 2-17A(CSTT-Sem-) pn corr se apna homomerintveny : ‘Sie Mee a sine FE een ander complementation ay wee he 1 epee eee te iP agerhomemorphiam siti Pig 2221 eve name atin a epelarnnesnt™ AS pomomorphim, then KU) ie ulg a = rie ‘Fa pica ctovurepropertin Le, concatenation, wan, ae engieimgeninesig | eon of ea ane Soest [ARFO 007-1 ar irre ren == eh aL) Union rf £1 an £2 are two regular Langan, their seni EES an brea ; Foccnamles Peneak =e oe EXETTTE sonata or in20) ‘Lat Lb the language of ela expression 01° + 10 y. 13 = LU L2 = (ar tt |n 201 is also regular, se in frei expression ob" +a ‘Condtontion Vi 11 sod 22 are to rege engage, tee oil oseman tober ence Lat Li = (a|n2 01 and L2= (6"|n 20) tama tcBee Rte | shiciescetseeattahe Peso che a Sioteanenlonattanp ear va cane mee mem : | | ERR oiitiorcrs co ame J ‘Weve te the representation of regular languages in r= Sitar © ej etching trata DEAN Oat - ‘as 7 ‘Gera DPA rh AL) wt the same acto tate. DS [a> Gs tela c=) | ‘ar ate sume al atts and inp alphabet Pigeonhole Principle, Pumping Lemma, Application « Biman anctee cenit Toon Deeb: Do Proper, Pe {Stig vied wel gone inp = Tier Lanewem, Saar enone ieateoarae Sitetaon of rnston hon ‘Example: Seed sth Conc Scanned with CamScanner= i esac ign tm navooles then sta sea ne tlm coating eth, ms PD ig eee ee Pepe ad the a RESDET TE ute tf gsnol lens than the number of pone see ect aving gee 2 pigeon 4c RECESS ite atgnedtaore than one pig. Pe ee ie pple ls ws othing abot how te TEE pisnlt hanna te or moe isco. (Men anete the exten of piensa containing two o mare ene [Ftp rile oe haste dei which beets wil play there ipgemsod heh abject ay the rae piwonhols. Bees] sae ane for regular ove the pumping le ane 2 Iolge bien ith 8 wg atin iota TRB stringy not too far from the begin Sd ata Proof: Pe Sppse Lie rol Then = 8D for some DFA. M. Supe Mae 2 Now consider any string w of length mor more. Lat ae theremsnandeacha am patsy for = function of Mand a ithe star state af M. That ip, the state, Mie Imaer roding heist apbol a tithe Pico ence pombe the ere p= ferie0 tena toledtinct sce ther ar ani dfleen ates 4 Thwwe can Tukostcysarroch -emaybemgtyin the cee has = An: mayb empty i= 8 Fnnwevees ent be some, snc istry estan 6 Nowevnatdcrmhat apne ifthe utmaton yee £ (etpung tae a Fi 220200 np Thos cep 2. eitatinli gost pyinp oo nou rele: rom 1. eee Sas waleenceptd ty tat yo “Qe tae | Explain the application of pumping lemma, Toor | Application of the pumping emma are: Tee hn ea arty ust prong that certin ats ae ton tgulr The poral icpeentsapgication are BT ane nrela Lete he umber of tte correspring rx ‘Mop asChwe astrings h that 4 ae pumping lea to weite techy wth eisai [o> Stop 4s nu vatate tor! ne hate « L-Thisconradcts our ‘Scanned th ConSconner Scanned with CamScannerao pening oom TIT andar pnuege + Refer Q. 225, Page 2184, = fa rp] ne hg dome Loe angag Ry sora = oon « L ee fr ae mee ere om {By men WY och engage ald ops esc actin oF Boing ele = TS ebm erp. Prva heagsge ona pime on Sits Pumping Lemma fr repulse Show thatthe at L101 Pivaprinelionot regutar, i fi : ‘Theory of Astemata & Formal Languages 2-81 ACCT Bom newer Pumping lemma :ReferQ 2.26, Page 2-164, Unt ing 2.25, Page 2-184, Unt 2 Slept: We upon Lice. Late te ner tts inthe iit suttmetee epting Step2: Let bea pine number grester than p, Let w =a, By pumping lemma, wean bm written as = ge with ay | <4 andip[> 0.29, are simply rings ofat So, y 24% forsome mI (and 2) Step stett=p 1 Thenlay= [yal + y[ap ett—Tim=ppm.By pumping lems eL But eyis|2p¥pm=p(1 +m) and p+ mis Eprime Says Thsin contradiction re, ine ear ‘Guo: Prove that following are not regular languages L("|nteportect square 4. These of strings of form 0! such thet the greatest common Aisioe of and te om Vala Pmpag maa fr oa langage prove tha langage =e L(0*|min perfect quar) 1” Hfat er rappneL be a regular tp be constant provided by Damping imma Let be the seg ‘2 Thunatring sin and eo length at last. So we can write liyl zpandycandeachorab aL Shoe x ¢7.y emma of more than p sandy +¢.s0 there 4. Nowehaose tbe 3 andthe reultig string iy 5 Wehareto prove thatthe length of: sot perc square, In Face we have to abow that tes met strietiy im between we onecatve perfec squares, namely dp D> 6 Unig stand fr lngth of. Men the length of yelp ¢. So Beptacpe i” 1. Fae fiat nnquaty ols since @> 0. Fo secod ineguaity, we Seonips inp etopi Sieg ere 1 Thiscontradicta the pumping lemma, our aasomptin that Ah LL ao wach ae ged) Wesssame that this rep language Now onside thre cae Cae tstat 22 hy A beaang eb coding paige a sting then ue, ‘Scanned th ConSconer Scanned with CamScanner