FACULTY OF ENGINEERING, SCIENCES AND TECHNOLOGY

Subject: Formal Languages & Finite Theory of Automata Marks:

Instructor: Muhammad Faizan Tahir Assignment # 01
Program: BS (CS)

S.No. Assignment Coverage

Q#1 Draw a DFA for Traffic Light Signals?
Q#2 Conversion of NFA to DFA:
Example 01:

State(s) 0 1
q0 q0, q1 q0
q1 q1 q1
q2 q2 q3
q3 - q2

Where q0 is the initial state and q3 is the final state.

Example 02:

Where A is the initial state and B, D is the final state.

Q#3 Read Chapter No. 02 ‘Finite Automata’ from Book “INTRODUCTION
TO Automata Theory, Languages, and Computation, 3rd Edition by
JOHN E. HOPCROFT, RAJEEV MOTWANI & JEFFREY D. ULLMAN”.