Course Code: CSF309 Printed Page 1 of 1

DIT UNIVERSITY DEHRADUN

B. TECH (CSE/ IT) ASSIGNMENT-01 Summer Term 2023-24
Subject Name: Theory of Computation
Time: 2 Hours Total Marks: 05
Note: All questions are compulsory.

1 Construct the truth table for (P∨Q)→((P∨R)→(R∨Q)).

2 Construct a Nondeterministic Finite Automaton that accepts all strings over an Input alphabet
{a, b} where each string contains either aba or aab as a substring.
3 Prove the following with the principle of induction:
𝑛
1 𝑛
∑ =
𝑘 (𝑘 + 1 ) 𝑛+1
𝑘=1
4 Compile the following Nondeterministic Finite Automaton into its equivalent Deterministic
Finite Automaton.

5 Explain the significance & uses of the Moore and Mealy Machine. Compile the following Moore
Machine into a Mealy Machine.
Present State Next State Output
a=0 a=1
Q0 Q3 Q1 0
Q1 Q1 Q2 1
Q2 Q2 Q3 0
Q3 Q3 Q0 0
6 Construct the minimized Deterministic Finite Automaton for the automaton given below-

7 Compile the following Mealy Machine, given in the table, into the corresponding Moore
Machine:
Present State Next State
I/P=0 O/P I/P=1 O/P
A C 0 B 0
B A 1 D 0
C B 1 A 1
D D 1 C 0