Top Banner
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

Aug 18, 2018

Download

Documents

hakiet
Welcome message from author
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.
Transcript
Page 1:  · (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
Page 2:  · (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
Page 3:  · (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
Page 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