CS5113 Advanced Theory of Computation

Assignment # 1
Date Given: Mar. 25, 2024 Deadline for Submission: Apr. 01, 2024

Instructions:
i) This assignment is to be solved by hand in your own handwriting.
ii) Use blue or black ink pen or ballpoint pen to solve your assignment. Use of any other color
ballpoint or ink pen, or lead pencil is prohibited.
iii) The assignment must be submitted at the start of class on the due date. Late submitted
assignments will not be accepted.
iv) The assignment must be submitted by hand in hard form. Soft form assignments submitted by
email, or on Microsoft Teams will not be accepted.
v) Avoid copying your assignment from other students, from a book, or from any online source.
Copied assignments will be awarded zero marks.

Q-1. Write a regular expression for each of the following languages over alphabet set { a b }:

a) Language of all those strings whose length is odd and contain substring ‘bb’.
b) Language of all those strings which contain at least two double letters.

Q-2. Construct an FSA for each of the following languages over alphabet set { a b }:

a) Language of all those strings which start and end with same symbol.
b) Language of all those strings which have even length and end with b.

Q-3. Let reversal of a language L be defined as the language obtained by reverting all strings
of L. For example, if

L = { ab bba babb }

then LR = { ba abb bbab }

Prove that if L is a regular language, then so is LR

Hint: Assume that L is defined by a regular expression R. Construct a regular expression

RR for the language LR.