Scribd
Upload
13 views2 pages

P17CS43 HSC

This document outlines the structure of the Semester End Examination for the Theory of Computation course at P.E.S. College of Engineering. It includes details on the examination format, with a compulsory Part A and a selection of questions from Part B across five units. Each unit contains various topics related to automata theory, formal languages, and Turing machines.

Uploaded by

mp4248728
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views2 pages

P17CS43 HSC

This document outlines the structure of the Semester End Examination for the Theory of Computation course at P.E.S. College of Engineering. It includes details on the examination format, with a compulsory Part A and a selection of questions from Part B across five units. Each unit contains various topics related to automata theory, formal languages, and Turing machines.

Uploaded by

mp4248728
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

P17CS43 Page No...

1
U.S.N

P.E.S. College of Engineering, Mandya - 571 401


(An Autonomous Institution affiliated to VTU, Belagavi)
Fourth Semester, B.E. - Computer Science and Engineering
Semester End Examination; July/August - 2022
Theory of Computation
Time: 3 hrs Max. Marks: 100
Note: I) PART - A is compulsory. Two marks for each question.
II) PART - B: Answer any Two sub questions (from a, b, c) for a Maximum of 18 marks from each unit.
Q. No. Questions Marks
I : PART - A 10
I a. Define DFA. 2
b. Define Regular Expression. 2
c. Write CFG for the CFL L= {anb2n │≥ 0}. 2
d. Define DPDA. 2
e. Define TM. 2
II : PART - B 90
UNIT - I 18
1 a. Design a DFA to recognise all the strings, over ∑ = {a, b},which ends with ‘aba’. 9
b. Convert the following NFA into its equivalent DFA and hence state the language recognised
by the same.

Fig Q1(b)
c. Convert the following €-NFA into its equivalent DFA and hence state the language
recognised by the same.

Fig Q1(c)
UNIT - II 18
2 a. Write regular expression for the following regular languages over ∑ = {a, b}
i) Ends with either abb or aba or aab
9
ii) L = {ai bj│(i+j) is even}
iii) │W│mod 3 = 2
Contd…2
P17CS43 Page No... 2
b. State and prove pumping lammra for regular languages. 9
c. Prove that for every regular expression ,R, representing the regular language L(R), there is
9
an equivalent DFA,M such that L(M) = L(R).
UNIT - III 18
3 a. Write CFG for the following CFLs:
i) L={ai bj ck│i =j or j=k or k=i}
9
ii) L={ai bj ck│i=3(j +k)}
iii) Palindrome over ∑={a ,b}
b. Define ambiguous grammar and hence prove that the following grammar is ambiguous
9
E→E+E│E*E│id
c. Convert the given CFG into its equivalent PDA
9
E→E+E│E*E│id
UNIT - IV 18
4 a. Design PDA for the following CFL L={aibjck│i=j+k} 9
b. Design PDA to recognise the CFL, L={W €{a,b}*│na(W)= nb(W)}. State whether the
9
resultant PDA is DPDA/NPDA. Justify your answer.
c. Define PDA, Instantaneous description a PDA and language accepted by PDA. 9
UNIT - V 18
5 a. Design TM to recognize the language L = {anbncn│n ≥ 0} 9
b. Explain any two extensions of TM. 9
c. Explain recursively enumerable languages and post’s correspondence problem. 9

****

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy