Course Code: CSE 213 Course Title: Theory of Computing and Automata Theory

CO3 [2+3] b) 1) Construct an NFA that recognizes all strings over {0,1) containing a 0 in the third and / in the second position from the end. ii) Let N, be the following NFA 1.6 Given that, I = {0,1). Show that the class of regular languages is closed under the star operation for the above NFA