Department of Electrical and Computer Engineering, North South University

Mid Term: CSE‐273/473: Theory of Computation

Name: ID:

Time: 2.15 Hours Total Marks: 30

[Answer all the following Questions]

Please create a pdf and name it in the following format: yourname_id.pdf. Submit your file on and
before 9.45pm, 19th August.

1. You need to add at‐least two more states and at least 3 more transitions on top of the following ɛ ‐NFA to [6]
construct a new ɛ ‐NFA.

Now, find ɛ‐closure (A, B) and ɛ‐closure (E, F) from your constructed ɛ‐NFA. Then use subset construction
method to convert your constructed ɛ‐NFA to an equivalent DFA.

2 You need to construct a DFA that includes at least 10 states each of which has exactly two outgoing [6]
transitions with input symbols 0 and 1. Now, use the table filling method to minimize the constructed
DFA.

3. Now, you need to take a string having length 6 or more, then check whether this string is accepted or not in [6]
the minimized DFA of Question 2 by using extended transition function. Your string should only contain 0’s
and 1’s.

4. Construct a Moore machine considering the following values of the tuples. [6]

Set of States: {A, B, C, D, E, F, G}, where A is the initial state.

Input Alphabet: {a, b, c}
Output Alphabet: {0, 1}

You are free to choose the transitions and the outputs of the Moore Machine.
i. Now, convert the constructed Moore machine to its equivalent Mealy Machine.
ii. What is the output of the string abbca with respect to the Mealy Machine?

5. Consider your converted Mealy machine of Question 4. [6]

i. Now convert that particular Mealy Machine to its equivalent Moore machine.
ii. What is the output of the string abbca with respect to the Moore machine that you just
converted?

Note: You will get some hints in the following page that might be helpful to solve Questions 4 and 5.
 Next State

Input a Input b Input c

Present State State State State Output

Next State

Input a Input b Input c

Present State State Output State Output State Output