· (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
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.