Scribd
Upload
22 views1 page

UCS701

The document outlines an auxiliary examination for third-year Computer Science and Engineering students at Thapar Institute, focusing on the Theory of Computation. It includes eight questions covering topics such as context-free grammars, regular languages, and Turing machines, with specific tasks like converting grammars to normal forms and proving language properties. The exam is scheduled for February 22, 2024, and has a duration of 3 hours with a maximum score of 100 marks.

Uploaded by

Anant Singla
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
22 views1 page

UCS701

The document outlines an auxiliary examination for third-year Computer Science and Engineering students at Thapar Institute, focusing on the Theory of Computation. It includes eight questions covering topics such as context-free grammars, regular languages, and Turing machines, with specific tasks like converting grammars to normal forms and proving language properties. The exam is scheduled for February 22, 2024, and has a duration of 3 hours with a maximum score of 100 marks.

Uploaded by

Anant Singla
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/ 1

Roll Number:

Thapar Institute of Engineering and Technology Patiala


Computer Science and Engineering Department
Auxiliary Examination
BE COE & CSE ( Third Year) UCS701: Theory of Computation
22"dFebruary 2024, 5:30PM Coordinator: Dr. Sunita Garhwal
Time: 3 Hours, Max Marks:100
Note: Attempt all questions. Assume missing data, if, any, suitably.

Q 1 . , Consider the context-free grammar:


S -> ASB
A .4 aASIalE 10
B 4 SbSIAIbb
Convert the Context-free grammar into Chomsky Normal Form.
Q2. Consider the following grammar and convert it into equivalent GNF grammar.
S -> XAI BB
B 4 b I SB 15
X4b
A -> a
Q3. Prove that Regular languages are closed under union, complementation and 15
intersection. Justify your answer with suitable examples.
Q4. Given the context-free grammar:
S - > AB I BC
A - > BA I a

B - > CC I b
C -> AB I a 15

Apply CYK algorithm to determine whether the string w=baaba belongs to the
language generated by above given grammar.
Q5. Consider the regular expression r = b(alb)b*b
Convert the given r into NFA using Thompson construction. Convert the
obtained NFA to DFA using Subset construction and minimized the obtained 10
DFA.
Q6. Prove that Context- free language are not closed under complementation. 10
Q7. Draw the flowchart for the language L={anbncm I n, m 1.}. Write down the
transition diagram( PDA ) for the above designed flowchart. 10
Q8. Write down the logic for design of a Turing machine for the given language
L={ ww I wE(0,1) }. Design the Turing Machine for given L. Give the trace/ 15
Instantaneous description for the string w=110110.

You might also like