NEELAM COLLEGE OF ENGINEERING & TECHNOLOGY,AGRACLASS TEST-1 (2009-10)

B.TECH (CSE), 2nd Yr, SEMESTER IV Theory of Automata & Formal LanguagesPaper Code : ECS-403 MM : 15 Total Time : 1 hr

Attempt Any Three Questions :

1. a) Find the transitive closure R+ and reflexive and transitive closure R* of the relation – R = {(1, 2), (2, 3), (3, 4), (5, 4)} 2

b) Construct DFA equivalent to the following NDFA – 3

2. a) Design a FA to accept the string that always ends with 00 over alphabet {0, 1}. 2 b) Construct a minimum state automata equivalent to a DFA whose transition diagram is defined by table – 3

3. a) Design a DFA which accepts strings with at most five 1’s over an alphabet {0, 1}. 2.5

b) Construct a NFA in which double ‘1’ is followed by double ‘0’ over alphabet {0, 1}. 2.5

4. Convert the following NFA to equivalent DFA and hence minimize the number of states in the DFA. 5