BAHRIA UNIVERSITY (KARACHI CAMPUS)

MIDTERM EXAMINATION –SPRING SEMESTER – 2020

(THEORY OF AUTOMATA- CSC-315)
Take Home Assignment

Class: BS (CS) 4 A &B (Morning)

Course Instructor: Dr. Raheel Siddiqi Submission Deadline: 31-May-2020
Max Marks: 20

Note:
 This is an individual assignment. Group work is NOT allowed.
 Plagiarism is NOT allowed and a viva may be held if plagiarism is suspected.

Question# 1: [3]
Design automata for the following languages
a) L = {anbmcp | n , m, p > = 1}
b) L = Set of strings over {a, b} containing aaa as a substring.

Question# 2: [3]
Remove useless symbols from the following CFGs:
a) S → A C | B
A→a
C→c|BC
E→aA|e

b) S → A B | a
A→BC|b
B→aB|C
C→aC|B

Question# 3: [3]
Convert the given NFA into an equivalent DFA.

Question# 4: [3]
Convert the following regular expressions to NFA-ε:
a) a*ba*ab*
b) (0+1)*1(0+1)

Page 1 of 2
This study source was downloaded by 100000859852428 from CourseHero.com on 06-14-2023 12:44:58 GMT -05:00

https://www.coursehero.com/file/62241238/Theory-of-Automata-Mid-Term-Spring-2020-11052020-045123pmpdf/
 Question# 5: [2x4=8]

Given the following DFAs, construct equivalent regular expressions using state-elimination
method.
a)

b)

Page 2 of 2
This study source was downloaded by 100000859852428 from CourseHero.com on 06-14-2023 12:44:58 GMT -05:00

https://www.coursehero.com/file/62241238/Theory-of-Automata-Mid-Term-Spring-2020-11052020-045123pmpdf/
Powered by TCPDF (www.tcpdf.org)