(0) Prove that it P and Q are regular expres- sions over Z, where P does not contain 2, the expression R = Q + RP has a unique solution given by R= QP*. 5 7. (a) Convert the following Grammar into i Chomsky Normal Form (CNF) : 5 AUTOMATA THEORY SaAla|B|C ae Full Marks -70 A> aBlE < i or Time-3 Hours Answer Question No, 1 which is compulsory angsty five trom the rest. Bo aA C+cCD > (b) What do you mean by Ingjanfaneous ' Description (ID) of a 4gain machine ? Indicate the differene@Petwoan ID of aPDA. te jures in the right-hand margin and ID of a turing machine. 5 : indicate marks. Sa. SERRE one | “QD Answer the following questions : 2x10 e (a) Greibach Normal Form vs Chomsky \ Noval Fé (a) Design a Turing machine to accept the string W=111. (0) Deterministic Finite Automation vs a Nondeterministic Finite Automation (b) What do you mean by deterministic in (c)_ Church Turing Hypothesis. deterministic finite automata. (©) Define Context free grammar with an —_—— example, BCSE 3308 4 -c 0.BCSE 3308 2 Contd. BCSE 3308 3 (d) Design a PDA for the grammar given 3. (a) Obtain the regular expression from the DFA, below: 7 S—aSla|b (e) State the difference between NP-complete and NP-hard problems. RA (f) What do you mean by recursive and 8 recursively enumerable languages ? NS ~ (g) Minimize the regular expression @ (b) Define Moore Machine. Whats the length (O+11*(0+10")+ (+114) (10410) ( aD of the output string for Moore machine for (10+10")" input string of length k 2 3 (h) State Chomsky Normal f Qn an 4. 1G) DeagagTangiachnewend recone: example. | meghot a binary number. 6 KO) Een Sie ragN eee Ses Sore tie cts ol riguairnats encod dable problem and intractable problem. . under complementation. 4 () Write a regular expression with & = (a,,c) _ . such that no string contains more than ‘SS. @)_ What do you mean by ambiguity in context free grammar? Explain with example. 4 3a's (@)_ Design a PDA that accepts by final state. (b) State and prove the undecidabilty of Post's the language 5 correspondence problem. 6 L= {(WW'/ We (0, 1}*} 6. (a) Drawaminimal DFA that accepts all binary () Discuss Chomsky hierarchy of languages. strings over & =(0,1) having even number 5 of zeros. 0.