Maharaja Agrasen Institute of Technology

Department: Information Technology

Assignment No: 1

Subject Name: Theory of computation

Subject Code: ETCS- 206

Issue
Date:

Last date:

Faculty:
Bhaskar
Kapoor

Semester: 4-I123

Unit/Title:
UNIT-I

Pages: 5

I-Term Exam
10/2/2016 Day

1. Explain the concept of Automation.

2. Explain Transition Diagram, Transition Table and Transition Diagram by taking an
example.
3. What is the difference between Deterministic Finite Automata (DFA) and Nondeterministic Finite Automata(NDFA).
4. Explain the concept of Automata with output with example.
5. What is the difference between Mealy and Moore machine? Explain with example.
6. Explain the procedure for transforming a mealy machine into a Moore machine.
7. Explain the procedure for transforming a Moore Machine into a Mealy Machine.
8. Explain Construction of Deterministic Finite Automata from Non-deterministic
Finite Automata.
9. Write procedure for construction of Minimum Automata or State Minimization of
DFA.
10. Design DFA to accept odd and even numbers represented using binary notation.
11. Design DFA which accept L(M)= {w |w
o tai

{0,1}*} and w is a string that does not

o se utive s.

12. Construct a DFA the language recognized by the automaton being L= { 0m1n |m 0
and n 1 }

13. Design a DFA the language recognized by Automaton being L= { a nb | n 0 }

14. Design the finite automata to recognize the decimal number divisible by number 3.
15. Determine the DFA schematic for M=(Q, , , q0,F) where Q ={q1,q2,q3}, ={0,1}
,q1 is start state,F={q2} and is given in the table below
Initial State Symbol Next State
q1

q1

q1

q2

q2

q3

q2

q2

q3

q2

q3

q2

16. Obtain an NFA to accept the following language L= {w |w

ababn or aban where n

0}
17. Design an NFA to recognize the following set of strings abc,abd,aacd.
18. Construct a DFA from the given NFA
Present State
Next state
0

q0

q0,q1

q2

q1

q2

q1

q2

q1

q2

19. Construct a DFA from the given NFA

Present State

Next state
0

q0

q0,q1

q0

q1

q2

q1

q2

q3

q3

q3

q2

20. Construct a DFA equivalent to NFA M=({p,q,r},{0,1}, ,p,{q,s}) where is defi ed

in the following table:
Present State
Next state
0

q,s

q,r

21. Explain the concept of (null) move.write the conversion of an NFA with Moves
to DFA without Moves.
22. Convert the following NFA with Moves to equivalent DFA.

23. What do you mean by DEAD state?

24. Write the procedure for minimization of finite Automata.
25. Construct a minimum state automation equivalent to finite automaion given in
digram.

26. Construct a minimum state automation equivalent to finite automaion given in

digram.

27. Design a Mealy machine which can give output EVEn,ODD according to the total
u ers of s e ou tered is eve or odd.the i put sy ol are a d .
28. Find the Mealy Machine equivalent to the following Moore Machine.

29. Transition diagram for the Moore Machine is given below.Construct the equivalent
transition diagram for the Mealy Machine.

30. Convert the given mealy Machine into its equivalent Moore Machine.