i | i : : : a i | i t a I CBCSISCHENE 18css4 ation, July/August 2022 ity, ; lax. Marks: 100, [Note: Answer any FIVE full questions; choosing ONE full question from each module. ‘Modute-t Define the following tems will sn example) Alphabet i) Power of an alphabet {i Sting 9) Sting concateaton v) language. (esmants) Explain the hierarchy of agiage classes in automata cory with diggam. (0S ark) Design DFSM for cacy of he following langoage.( 1) L= (oe (01) s0-doesnotendin 0}, 4i) L= {ae a,b): every in a isimmedinsly preceded and folloved by b) ‘ans on 1, Use MINDESM algoriti to minimize M given in Fig Q2(). Fie Qn) asm) 1b. Converts flowing NDFSM given in Fig Q218) fois equivalent DPSM, Fig 20) (sins) Design a mesly machine it sks binary number as inp and produces 2's complement of the number as ouput (et art) ‘Module: 44 Define Regular eesson. Write reglar expression forthe following langage ) L= (Ome la tyman>3) ii) L= (a a,b)":suing with amostone pur of consecutive a's) @8 Mark) Obtain NDFSM forthe regular expression a' Usb) (@Ub) (estat) 10f318css4 ‘Build w regula expression forthe given FSM in Fig Q3@) a Fig 3) coms, on 1 State and prove punpigg Lima theoren for regula ange. assis) 1. Prove that gular languages are closed under complement. (asm ©. While regula expression regular grammer end FSM forthe Inguages L= (we (a,j: 8/ends with patem ana} rms) Modules 4 Define Coitest Fre Grammer (CEG); Write CFG for the following languages L= (ORI 2":m> 1,020} essen 1, What isambiguty in grammar? Bia abut blnced pete gma? ©: Simplify the grammar by hoving productive ail uneachable symbols Sr ABIAC A—aAble BabA Cabce DAB 7 Mtens) oR ‘Defi PDA and design PDA ta dcop the language by final state method, Mats) UM)= (aCa* jae (ats8)-and 0" isrevere of o} . Conver the following grammar to CNF 3 ASBle Be aly CMRET LiKAKY B+ SbSIABS, pao 60 sans) Consider the griamar woe E-E+ BB *EIE\id Construct LMD, RMD and past te fr the sting (i+ id * i). (@smaay ‘Module-$ ‘Define Turing Machin (IM). Design a TM for language (0"1" n> LfuShow tha the sting 0011 is accepted by ID. onan Explain multiple TM wih a neat diagram. 5 Mois) Explain any syo iechniques for TM construction. (sma 20f310 18css4 on ei eM fhe languge = (1°23 nh tt he ing 223 sacra by ID. (asta) Demonsrate the model of Liner Bounded Autopaia (LBA) witha neat diagram. (08 Mri) Moauies Stow tht Aor dvd. ost Defing Por Conespondenes Prt PCP) Does the PCR Awe Tat x= (bb 80) (b', ba, b) have a solution,. (08 Marks) ‘Explain quantum computation. . (7 Marts) renal Braet so or Prove te Anis deel (ost) Docs the PCP wt ve nx = (0, 0100, 13= (00, 01,1) Rave soliton. 6S Mak) Ste explain Church Taming Then i (ost) 3083