Theory of Computation - Old Questions

11.  Explain about the closure properties of regular languages. Show that for any regular languages L1 and L2, L1∪L2 is also regualr.

8 marks | Asked in 2076