Bangladesh University of Professionals (BUP)

Department of Computer Science and Engineering (CSE)

Program: B.Sc. in CSE
Mid Term Examination (Makeup)
Course Code: CSE 2105 Title: Theory of Computation
Date: 11.02.2023 Full Marks: 40
Time: 50 min and 10 min. to upload your documents to asmmr@juniv.edu Pass Marks: 20

Instructions:
A. Answer any four (04) questions
B. Marks are shown in the margin
C. Symbols used carry their usual meaning

Q1 a) Prove the closure properties of Regular Languages: If 𝐴1 , 𝐴2 are regular languages, so 10

is 𝐴1 ∪ 𝐴2 (closure under ∪)

Q2 Design pushdown automata (PDA) for language {anb2n | n >= 1}. Find its terminals, non- 10
terminals, Stack symbol, and start variables and transition functions.

Q3 Draw NFA for the following statement “L = {w|w third last symbol with a}”. Write a step-by- 10
step process to convert it to DFA.

Q4 Write a CFG for the following Statement: “The string starts and ends with different symbols 10
where Σ= {0,1}”. From that find terminals, non-terminals, and start variables.

Q5 a) Minimize the DFA 10