· (b) Find the regular expression accepted by following automata : n bn : n > 1 is not...
4
· (b) Find the regular expression accepted by following automata : n bn : n > 1 is not regular. 4. (a) Show that L = (b) Prove that the set of regular languages are closed
