JAYPEE UNIVERSITY OF INFORMATION TECHNOLOGY, WAKNAGHAT TEST -1 EXAMINATION- 2023 B.Tech-VIE Arie (CSE/TT/ECE) \€é ACT COURSE CODE(CREDITS): EISBIWCI740 (3) MAX. MARKS: 15 COURSE NAME: Formal language and Automata COURSE INSTRUCTORS: RKL.DHA, SGL, VKS MAX. ay aceaantEEta Ht Av Note: (a)Marks are indicated against each question in square brackels. Altempt ai 5 questions eee : ‘ QL. (i) What is the objective of leaming automata theory? {1 (Col) (i) Design a FSA for a password protected door controll ‘we extend the door controller gets locked for 1 days on wrong attempt for (28 happens in net banking system), if no then what kind of extra features need to oe [1.5+0.5] [CO1, C02] QW. (i) Please give some of the strings accepted re (L) which accepts even number of 0 followed by 1 divisible by 5. Create the Dj fort. [0.5+1.5] [CO1, CO2] (ii) What is the motivation for 2 [0.5} (COI, Co2] Bs, Q3. (i) Can we transform a onthe final states into a DFA with single final state? v [1] [CO1, co2] Gi) Why given oe js NEA? [1] [Co1, cor} a tt (a) Page 1.0f 8).(i) (@) 2 (2) Consider Qu is the final state. opting siting ub, hcbT, cozy NX v Q4. (i) Create a DFA to start with even number of 0 and odd | RR start with 1 and even number length string. © 2] [COt, C02] Gi) How many number of states will be in equivalent aw NFA which has 5 states with all epsilon transition? O (1) [coz] QS. Create a DPA for L={w: (ng 04) mod 3 re ‘and n, represent number of a and b respectively, & {3] {C02} Q6. Create a DFA for a a even number 0 and number of b produce remainder 2 when divisible by. [3} [C02] a Q7. Which kind of soe Pypsered by below NFA. Convert NFA to DFA for that. [0.5+2.5] (Co) Ca (ab) HOOD) Page 2 of 3),