Department of Information Technology, Division of Physical Sciences

GC University, Faisalabad.

Assignment No # 01
Class: MSc (IT) Semester: 2nd
Date: 01/04/2020
Subject: Theory of Automata Course Code: MIT-512
Max. Marks: 50. Instructor: Rabia Shahid
Rules for Assignment Making and Marking

Carefully read all instructions before attempting your assignment.

It should be clear that your assignment would not get any credit if:

 The assignment is submitted after due date.

 The assignment is not uploaded on student portal.
 The submitted assignment does not open or file is corrupt.
 The assignment is copied.

Note that strict action would be taken if the submitted assignment is copied from any other
student. Both students will be punished severely.

(1) You should take reference from recommended books, video lectures and ppt to clarify your
concept as handouts are not sufficient.

(2) You are supposed to submit your assignment in .doc format (word document that contain
scan images of your hand written assignment) at student portal till 15 th April, 2020. Any other
formats like Zip, bmp etc. will not be accepted.

(3) You are advised to submit your hand written assignment too after 31 st May 2020 on
resumption of semester.

Note: Material that is an exact copy from handouts or internet would be graded
Zero marks. Your solution should consist of the material found through different
sources and written in your own words.

Due Date:

Online submission (.doc format) 15 April 2020.

Hand written assignment 31 May 2020.

Reference Study Material: https://computergraphics--

rabiashahid.blogspot.com/2020/03/thoeory-of-automata.html
Q1. Consider the language S*, where S = {aa,b}.
[Marks 03]

I. How many words does this language have of length 4?

II. How many word does this language have of length 5?
III. How many word does this language have of length 6?

Q2. Write down all rules for recursive definition of language.

[Marks 03]
I. Defining the language of Palindrome, define over ={g,h}.
II. Defining the language {acbckc}, c=2, 4,6,8…. of string defined over ={a,b,k}.
III. Defining the language L, of strings starting with a and ending in q, defined over
={a,q}.

Q3. Show that the following pairs of regular expressions define the same language over
the alphabet  = {p, b} [Marks 03]

I. (pb)*p and a(bp)*

II. (p* + b)* and (p + b)*
III. (p* + b*)* and (p + b)*

Q4. For  = {a, b} [Marks 03]

I. Build an FA with three states that accepts all strings.
II. Show that given any FA with three states and three +’s, it accepts all input strings.
III. If an FA has three states and only one +, must it reject some inputs?

Q5. For  = {z, j} [Marks 03]

I. Build an FA that accepts only those words that have more than four letters.
II. Build an FA that accepts only those words that have fewer than four letters.
III. Build an FA that accepts only those words with exactly four letters.

Q6. Determine a Regular expression corresponding the following Transition graph. [Marks
05]
a

ab a ba

b ab

bb
+
Q7. Determine a Regular expression corresponding to the following Transition graph.
[Marks 05]

x4+

b
a,b

a
x1- x2
ab

ba x3

Q8. Build a Finite Automata accepting L* where L of accepted by the following Finite
Automata.
Hint: Covert each iteration into transition table. [Marks 05]

t u u,t

u t
x1- x2 x3+

Q9. Build an FA accepting to L1L2 where L1 and L2 are accepted by the following FA1 & FA2
respectively. [Marks 05]

x2

j j
j,s

x1- j s x4+

s
FA1 s

x3

s j j,s
 j s
y1- y2 y3+
FA2
Q10. Convert the following Non Deterministic Finite Automata into an equivalent Finite
Automata. [Marks 05]

w x
x1 x2 x3

w
x w

x4+

Q11. Covert the Following Non Deterministic Finite Automata to an equivalent Finite
Automata  = {a, b}
[Marks 10]

1- a 4+