20 26-12 Introduction EO AUtorMata “Meory ¢ Automata Theory ov Meory oF computation oo branch OF computer science & raathemnatics which maioly deals uxth the togic of . computation uth aespect to the sieaple machines reFexed 0S Automata. Automata enables the scientists to understand how machines cornpute the functions. & solve the problems. The main motivation behind develop!ng the automata 1S to develop methods to describe & mnalysé Oe OS wehaviour OF discrete Systems coth partial participahton oF humans. Fundamental concepts oF Automata Theory : t. Syrnbol a. Alphabet 3 Sewing q@. bangvage Symbol: TE iS also catied 4S chavactey . It 1S Ehe entity. smaitest ‘burldingmmblaen. tty Pasi onect | singe €9: 4,4, b6,B Al + af , lphabet “:. Ft. ie ee Miminite gee Brean OLS eeg settee tx’ . Tl IS used to swepresent input oF ‘a macnine- eq; Z2fony , Z rtar} St1ING + Stung 18 a Finite sequence oF Syrnbel's chooeen FIOM alphabet C2) and ak 5s denoted Y Ss) sg = SbTING w-word . €g-2 z o1o1 16 ol valid eTIeg «ovet the 2 DELOEg-' : considev @ alphabet 5 =$a,64 The possible valid strings’ 9 axe ad’, BH aba, ba , Operations en Sevings : |. Empty Sering~ Tt is denoted by, & (epsilon) g it 1S @ sting wrth 0" occuTtence . Clength 0) 2 Length. Tt 16 - dernpedirige ino.0F cymbals S16 ys denoted by [S| &9: 93. puya Iso & 3 concatination ; sf 5) & 59 are twor senngs then thelv concatenation. 16 “ade ned ag fas £9: si = priya g@= Narayana I-89 = priydNaxayane § 1 49 uw StringReversal : tt means reversing the syrnbols oF a qveN - (German ity ter leno red by: 3S 92 Sai * lout fs yop Ss las . Se is aee » ier Fe ppp Language som is 07 ceteor sens over on alphowet aS gh ta site: PORE =o construct a. Longquoge eons vee alt th “sevings: oF length .«2' over the, alphoret = Fong * £00, 01,10, 0}. F9-B = constwuct a Language “containing all the stings — a ; which — ove ending with 1a’ over the = = Gone Dg UT > $a, aa,ba, aba, bba a nn Ope TAMONS onIntevsection- TF Li & Lg are two languages then ther intersection 1S deFined as 1, OLg Eg: 1, = Sav,aa, bay iss Pov .2 + bad LiOLa = fab, bay pifFerence ~ IF Li & Le are two languages tnen thelr airfrerence 318 defined gs 1i-ta £9 = 2 = fab, 0a,ba} Lg = 2 bb, abs bay L,-te = Paat Oy sah Kleene closuve| Kleene star : Xe 18 deFined “as the set OF ol! possible atl possible lengths ever an alphabet > strings oF ts! including. null string CE) & Ib 1S denoted bY ste Ch 1S & Language ). Let Xe Garb} * 2) tebiea oe FEE Kleene plus : Ar ‘ . ala a 1 os the set /oF all possible me is dermed loet cn! all possible lengths over an atpha x 5 + ond tt 16 denoted SY eat) string (8) : x 2fa,eF . + x* = fa,b} r* = $9,6, 0b) 0,00, bb, abb---¥ excluding se Tings OF nullPrtroaverion £2 emite Automato (FA) | Finite state Machine ¢ Th 18 ppstract machine ov mathematical roo det with dike. ne OF RES, HpU: sybase RDAs ee aaa ovey 07 alphabet (2). (or) minke NO.OF FA ov FS 18 A abstract mode wit FIP ‘ states: Texronology ; eats 1 State= Je is a srnau cixcle uoith state name: two states- 2 Transition- I 1s a divect edge BID any bw Ineiat stote- Tt is 0 state with on insoneing edge ewithout source - £9: 3G) ae ee ee Final state- re is a state state name. et . ‘ a ‘ ee as Berinition oF eal matrematie hh actiten oF 2g. ners Fo [tuples oF FA Het ashbi + an£9: considev the given FA. © = }8o,9) = 2 fo.ly i Go = Se F FS say Representation OF 1. By Using pias a. By sing Transition Table = Finite Auromata ¢ Trans too diagrar? z ansition Table | es Oo] 1 So tsy § S09 | @ = 240, 4,42} ‘ Ne] 2 | ; zp fairey 20|190,.94| © Io = Fo ; ; 4 ¢ $41,903 Ft. St Ya |392,93| L293 Nore; For any FA state & tnere Final states: K Rows represents states may be chonce and ehere shovid be represents mput Symbols only one intial oF moltiple columnsAiodet oF FA : Te FA mode! consisting of Intec parts, 1. Input Tape @ Read Head 3 FINNEE control Input Tape - Tt is a iimeoy tope hovéng Finite no.oF cell Each input symbol ye “paved sexactly 19 one cell: cls one by one Fro is read Read Head |ape Reader : se reads We © lePE eFE €O might. AL any time only one input sy eps) Finite ai Xe eae tne decides the next state en neceiving ti ax EIcUl es cs ax input a ends with a 20 L = £0, 10,00 , 010,000, NO --- 5” Q' eva .j P Q = f40,41} z= fo} 6: Yo > to F=qQi ®& gubstng oS aa’. Le Yaa, pad, Gbaa, 22hlength aa : RIOR cy one a al we = gi 10 Np80 0100 J LED HOPG! WOlor pesign oF NFA pesign NFP Fox all 5 all the strings Which are Lb = FOr, O1Ol, OO, —~ on 2) +@) 0 pesign NFA Fox all the StTINgs 19 wich “ul! construct NFA Fox accepting ali the StTiNgs axd Symbol From the aight end is always ending with '0! Followed 1m which tol. soecroirae odor oP ce aoe 6 OOO] constzuct NFA For accepting ol Ee oraee stungs starting Woe eO Oe ee na foo, wu, OO" N00 ---F ap! QI S60) ia am wohiehDFA % DFA stands For Deterministic Finite Automata: 2 It cannot vse Co Gransitions 3. For any ‘stote we. can hove onty one transition For the same input Syrnbkol- YU. more DIFFICUIE' bo ConserUck: 5. Time needed For executing an input String 1s tess. 6. Deod state may be required + Back tracking “1s alowed 1). ORO: 8 DFA 1S * subset oF INFA- Q. DFA vequites move Space. 10, Herve, @XE—¥6 ot NFA 1h NEA stands For Non- Determinietic Fintke = AUEOMALG 2 Tt can vse € wansitions 3. For any state we con have multiple ERGnsitions For the Same input SyMbol- Us “Easy: to. conistsUCk+ 5. Time needed For executing Qn Iwput string %S more. G. Dead state may not wequived: So paertracking ts, Mot allowed 6. NFA IS SUP! BOP She: rh aK. 4 qe NEA, requires, less Space 9 eames ee EA? 2 eset OF DFA:bi NFA and Equivalence NFA to DFA %) pFA the given convert woul Let the required Now, consexuct evaneitiog table FOr 40.42 | meat | 90 9! = $40, 40,91)» (4090) 5 eSiouy a0 = 40 F' = [40,99] convext tne gwen NFA'S tO DFA'S ae 7 Ov L624 46) ai AS ot the given Loe ‘ a > @ DFA (NFA to DFA conversion) be + (8s z,890.F') NEA 8 ((40,41),0) $ (40,0) 0691/0) ) & (Got)od) 8(40.91) $(C9o,%),1) S§(Gonjocai)) 7 § (4009) § (C4012) 0) § (C9010) 0(42.)) 6 (Cqo.9 OP) 80,41) 5 ((40,99):") (goo (4a,')) 6(40.00) dote Let (bhe required DFA will be DFA = Ge pee TO . 5 a + 6 $45 Si 3 SCT § (80,0) 05 (Sia)U 68,9) {50,514 0 Say OY (S018) 59,2) = | fsosiSah| 50% | $.s0 51159} ie soy} Usersisa) 46) = $0 pa 2 $01by Toe e! = peose1/Set NER with % moves : ‘ 4 fae 2 Ony NFR which contains & transitions 8 moves” then that Nea 16 called NFA with e&-moves-we have tO moves: From K heidae s nied pia Final Meeriose ves esisE-closuve = — closure For a given state’ A meaning thot a set of states which can be weached From state A with only €-moves including the state weselF- Eg: Find €-closuves For given NFO Qe & . &-closuve (99) = §90,41,924 . fey & -closure (91) 2 $4ndoh Bessa gt &- closure (4g) = faa} gabe Find -6-closuves For given NFA “ye aSROF hatycyY >. t ie age NFA without £o-MOVES For the given NFA Loith out &- moves To 3 ; t convert the given NFA with go moves tO» without Eo roves we have tO ‘vight Eo closures For all che states. FIYSeY, & - closure (46) = £90191 , Va} & -closuve (41) = $41,999 & -closure £92) = 2903 ' transie: 7 é FANS IEIONS ; wy 4 26828 is ae 6'(%,.G) = &- gcloeuie (s (6- ~bl6su 6 (ae = For the state Go, For the input symbol om 8’ (90,0) = & ~ alosure (6 =(g - closure (40) :°)) Cerca ¢ & faora9e), °)) ae 442.9)> &-c1($v0bv4%) > & -c1 (V2). 71904 For state q, $'(41,0) = & - clol 6 C& ct €41),0}) - , eae) Gamat ae Se PSameeys 0) ies eae 4 o *& -clWW dod) : og . : Serey =¢ eB = sie al Sas & ce SlE- crear) 2 & ~cbC8:(41,4.2) 1) % -eW ave) nae ~ebea) ay8' (99,8) + & -cl{S(& -~c1 (4a)9)) . = &-cl( 54a.) = & -cl4a) : fay Transition Table : a sl oe ie ina ea ped ’ £41 199}) $99}, oe i be ee : * S-closoY' herve 40,91:99 are Final state. because é-c¢ OF go, &-closute 4 & §&-closuTe Ge eo ntging qe. 2. @ ate j z Gp» & -closure (G0) #2907 ss, 6 ~closuve Chi) = 29% 1Vay an & ~ closure C43) 2399} foe eu transitions ES'Caia) = & - cb S¢g-c1¢41) 19) & ~cbl S(4)192) 0) = & -ch( de) sla 2 & -~ch( d) 2 2 ios S'C411b) > & ~ cl (8-C1091),b)) 2 & ~cWlSC(a92)14)) of 0 = & -CS(~09a)) ro? $99.0) =Regular Expression | Regulax Lanquoge = “he Langueges accepted by the Fimte automata are called — regulary ranguage: s the Expressions vohich are occepted Requiow Expression wy tegulay language are called Requlay Expression. bk consides , 0 wequid Language (+). & E> 1S a eegulor expression tor 18 a Tequiat Expression: then + Every letter belongs 2 % a. IF Ri and Ra ane two aegulay express10ns Rie BOo, Rivka 10h Conese eee where, + mdicates union 2 indicates CeMcatimation ._ %& indicates closuxe. A> construction oF Regular Expressions = ex0e's” _ Followed by eonstwuction RE to denote any No.of z. . any ae x s i Followed by any no.oF one’s no-oF two's.constvuct Q RE which accepts any no.oF a's & b's ans? (a+b) ending with Oo. “Ons: is eo Co +t) O° Relationship betwee Regular Expression & Fimite Auto mata conberoce poe? ae aes See ere Ee & istics”: o O~S 5 Ss atb ee ? ie conside® & é i sie a 2 CONCaENAEION case ; 6 F G a. ae & @230--B (0? (y (ay, yD 3. closute case ? abneide™s. am & am a. CONSETUCE Nea's For Fo Nacwoing, RE ba & va* x \ 2 b Ce eC rg @- OO) =H) | ey wi TT £ fr : megs ©. ead Wa] 30O1ti098Identity Rules = nh P+R=R 2 da: ro>%Bee rollocol gaa 2 Derive sequidy Expression FOX | ~ - Ae ) 28" we have to write Formulas For eVeTY StOte IN the given DEA qo = UW O4G 7) gene Gp = 410 +4g0 493) 7s es consider (1), Por Om ¢ ; VOL eae a praenis. RUT alameda a Re RP+@ = @p* 5 % = EO * 40.70 RES consider 9), g, = Go! +91! =O") eq! BO a™ Bes . ey 49 74,0 #490449) = = O* IF 0+ 4904 FI Se Okie, Derive Regular Expressio0 Fobtain Regular Expres sion For gwen FA 43 - (b+ aa)+q3a = (b+aa) ae gen? ee Chorasky Hlevarchy : K naan yed bY Nom ing H 2 YY Norn Chorasky .Acco™ sky xchy (1s Siscove nor L choms revave a ° TyPes- tnigpeene graramar is divided into G TH to tnis> Typed GrarnMa* Bee ce penl Gra 3. Type-9 Graramat ui Tape=s eo ania Type-0 Grammar tun mestuicted Graromay) 7 ; ; ; re was Te melvdes. all the, crowd a@ranomars + 7 GS erecdghiced,. ou: Tasiom gis aly mute F io va che productions ore ia the’ For) oF a—>B. where, ip = (vur)™ V = Non Terminals Ccapital leteers) Tae r oor ncn Cette (etters) <9 4 . oo" bAB a. &8= > 8B Tupe-1 a@arnmay : Te 1S Qlso cauled aS . context sensitive Grammar & it was recognised by Lineay Bounded ALtornata.Heve, all the productions which are in the Form oF a lel 4 1p) f= 1. WA eaeA 2 Ba = bA Tupe-2& GyYornmay : f it Was Te 16 also called as context Frec Grammar & 33m ee recognised by push Down Automata. tne production Form oF g—>p x > where, ; v to A—s& a. Abe ee Tupe-3 @rarnmay ; — Te «S$ most aestvicted GrammMot & tt Was ‘ < Spear oath by Fimte Avtomeata.s Tere are ‘TWO TYPES he Pe fh Ves VT (LEFE Lineax Groraracx) & VS TV (Right pineax Grammar) Fer bass dveag Language = Aveemation”