COMSATS University, Islamabad Campus

Department of Computer Sciences

CSC312: Theory of Automata Spring, 2021
Assignment#2A(Chapter 2, Mapped to CLO2, Submission Deadline 18/3/2021)

Q.1. Solve all examples given in the class + book’s examples the topics: Intro to FA, DFAs, NFAs, and
conversion of NFAs/ɛ-NFAs into equivalent DFAs
Q.2. Solve the following problem set:
• 2.2.1(a), 2.2.2, 2.2.4(a), 2.2.6, 2.2.9, 2.2.10, 2.3.1, 2.3.4(a), 2.4.1(a), 2.4.2(a), 2.5.
Note: The solution must be topic-wise in chronological order and supported by proper headings, e.g.
Section 2.2: Solved Examples (class)
Section 2.2: Solved Examples (book)
Section 2.2: Problem Set
Q.3a. Using all the three representations construct a DFA for the following language over ∑ = {0, 1, 2}
L = {w: the sum of the symbols in w is a multiple of 3}
For example, 021201 is part of the language because the sum of all its symbols equals 6 (6 mod 3
= 0); whereas, 010012 is not in the language because it sums up to 4 (4 mod 3 = 1).
Q.3a. Use the construction discussed in class to convert each of the following NFAs into an equivalent
DFA.