munotes®

Engineering B.E. (Computer Engineering) Sem 5 Theoretical Computer Science May 2019 Question Paper - Mumbai University | munotes

Theoretical Computer Science Question Paper, May 2019.pdf
CMPN · 197 KB · 1 May 2025

Loading PDF...

Questions asked in this paper

  1. Q2 (a) Design NFA for recognizing the strings that end in “aa” over ={a,b} & convert 10 marks
    • (b) Design moore m/c for following If input ends in ‘101’ then output should be A, if input ends in ‘110’ output should be B, otherwise output should be C and convert it into mealy m/c 10
  2. Q3 (a) Obtain a regular expression for the FA shown below: 10 marks
    • (b) Explain the types of Turing machine in detail. 10
  3. Q4 (a) Design a turing machine that computes a function f(m,n)=m-+n addition of two 10 marks
    • (b) State and explain pumping Lemma for Context Free Languages. Find out whether 10 the language L= is context free or not
  4. Q5 (a) Design PDA for the following language: L(M) = {a,b}*} where is reverse of w & c is a constant 10 marks
    • (b) Convert the following Grammars to the Chomsky normal form (CNF). 10
  5. Q6 Write detailed note on (any two) 20 marks
    • (b) Halting Problem
    • (c) Rice’s Theorem 88A89FBA80932F83D9895BA53BE7C716

Read from the scan above, so a character or two may differ. The scan is the original.

Issue

Something wrong on this page? Report it and we will check it against the scan.

Quick Help

No. The full paper opens straight away, with no login and nothing to pay.

Something wrong with this paper? Report it.

Connected Papers
Engineering / B.E. (Computer Engineering) · 250 papers
Browse all →
Questions? Email contact@munotes.in
Done!
Done!