Scribd
Upload
34 views

Automata Theory and Computability (18CS54)

PYQ |ATC|5TH SEM

Uploaded by

bibliophileonthesamepage
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
34 views

Automata Theory and Computability (18CS54)

PYQ |ATC|5TH SEM

Uploaded by

bibliophileonthesamepage
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 3
aN, Raghunath Rao Maenay Library BNM Soins of Bengaturu~560 070 CBCSISCHEN E USN 18CS54 Fifth Semester B.E. Degree Examination, July/August 2022 Automata theory and Computability. Time: 3 hrs. SE Max. Marks: 100 Note: Answer any FIVE full snctonsmpgaing ONE full question from each module. vo & <<, Module-1 £ 1 a. Define the following terms withah example i) Att ii) Power of an alphabet a 2 pI 2 iii) String iv) String concaizy gion v) language. (05 Marks) a b. Explain the hierarchy of ldfigfiage classes in automat hieon with diagram, (05 Marks) ny ‘eI i c. Design DFSM for eacl following language. 3." a i) L= fe loesnotendin 01} y z= ii) L= foe, every ain @ is immediately preceded and followed by b} iis és a (10 Marks) as A) OR i S 2 a Use midhysmt algorithm to aie given in Fig ea, z a, 28 35 Be u E> 2: 2 i eo Fig Qa fs (08 Marks) 2 t qe equivalent DFSM. ef ne LS uolUS ee a (omar és ¢. Design a mealy machine Liaigakes binary number as input and produces 2°s complement of ad the number as output. Rg” (04 Marks) 2 . Module-2 i 3 a. Define Regular ¢ ion, Write regular expression for the following language. zg i) L={ m2 I,n21,mn23} C ii) L= {@e°{a, b}": string with atmost one pair of consecutive a's} (08 Marks) 2 b. Obtain Asa for the regular expression (a’ Uab) (ab). (05 Marks) ® 1of3 S 18CS54 c. Build a regular expression for the given FSM in Fig Q36).. (07 Marks) o” or lo a. State and prove mig in theorem for regul age. (08 Marks) bb. Prove that regular langiiages are closed under compYehent. (05 Marks) ¢. Write regular expressign, regular grammer and FSM for the languages L={oe {a, DRS \ds with pattem aaa} (07 Marks) . a ~ Module-3 Define Coftext Free Grammer (CFG) 4Write CFG for the following languages L= (ORR 2": m>1,n>0} As) “ay (05 Marks) b. What is ambiguity in a grammar? Btiminate ambiguit balanced parenthesis grammar? at (08 Marks) ©. Simplify the grammar by rémnoving productive ani apreachable smb S— ABIAC Ry *, AaAble ¥ v B-bA . C+ bCa DAB (07 Marks) a) > at % ¥ OR a. Defin@PDA and design mien the a) final state method, (07 Marks) L(M)= {aC o® jae ( do is rvgegot a} b. Cogvert the following grz war to CNF_ to 38S asBle K ra Se # B— SbS|A\bl %S © (08 Marks) ©. Consider the r x E+E+E \E)lid Construct LMD, RMD and parsé tree for the string (id + id * i). (05 Marks) © y Module-4 a, Define Turing Maghin€ (TM). Design a TM for language L=0"1"|n> jow that the string 0011 is accepted by ID. (10 Marks) b. Explain multipfe-TM with a neat diagram. (05 Marks) c. Explain any tyo techniques for TM construction. (05 Marks) 20f3 10 oe . Explain quantum computatio 18CS54 OR a |. Design a TM for the language L = {1"2"3"|n> Ghat that the string 11 2233 is accepted by ID. (12 Marks) Demonstrate the model of Linear Bounded age (LBA) with a neat diagram. (08 Marks) ie s 1. Show that Apra is decidable. “ (05 Marks) . Define Post Correspondence meairce, Does the PCP.with two list x = (b, bab’, ba) (08 Marks) y= (b*, ba, b) have a solution, ay ‘ (ora OR . Prove the Arm is uidegidable. (05 Marks) Does the PCP va list x = (0, 01000, (000, 01, 1) have a solution. (0S Marks) State and explaig Ghurch Turning Thesis : (QO Marks) © 30f3

You might also like