' ins sw Nie _eraasnsem6 fee Mais 0 PARTEA (OX 10 Marko) Anger All questions wt Comer the rogue exesson given blo uv) r-10'ro it automaton that accepts LR) [S marks] seule stamma hat generate al strings in LAR) [S marks) eonstrct an equivalent deterministic finite automaton forthe on-determinstic awtomoton (1A. [10] B.C.D.E.F:. 1b. 6, A, iE: Figiven below: 0j>0tre BIEN DYN 2 aS Sunt stn Astor UUstnt HF Lek ap THEN Stk [IF Logkyp THEN Sti FESE Sit Natt = Ml Diet Dyit 0 2 Fa STN gExp M0 Woalbje de fg/hii gk Lm njolpig t s)tia yw x Digit. Logkyp. Mi The Non-Teraminas ae {Star Sunt Ham As Jue Terminals are IE, THEN, ELSE, 0% 97 Consider the computable function fig 4 machine {is postive imeper and in unary format tosis et by A Define the context-free language for the above scenario, (4 marks} “esi a pushdown auton ta ace tings in ah eC besin Tine machine to st ngs of san Oh The Tring mast stats san leftmost symbol of an unbroken Block of mise 0s as, which hls ler sanming the lsimow symbol othe Bock reaanged with ll the Os oth Ke 1s (in I the Lp Shing nthe es 101001 ten Outpt ting seul be O01} yee following dominos have a mash in she est correspon (PCP)! Brie criges eevee rea arr Gagan aaa (10) uo) (19) (19)