0 votes 0 votes Let L1 and L2 be 2 languages which are not regular. Which of these is true? The union of L1 and L2 is not regular. The intersection of L1 and L2 is not regular. Both I and II are true I is true, II is false I is false, II is true Both I and II are false Theory of Computation iit-madras ms written-test 2019 + – SPluto asked May 2, 2019 SPluto 604 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Gateasp2020 commented May 2, 2019 reply Follow Share option D is right 0 votes 0 votes prashant jha 1 commented May 2, 2019 reply Follow Share Both are false. Counter examples for each can be given. 0 votes 0 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes Let L1=$a^nb^n$ and L2={$a^xb^y$ | x!=y} 1. L1 U L2 : L=a*b* which is clearly a Regular Language. Hence I is False. 2. L1 ∩ L2: L={} which is Regular Language. Hence II is False. So, (D) Both I and II are False. Abhisek Tiwari 4 answered May 2, 2019 • selected May 24, 2019 by SPluto Abhisek Tiwari 4 comment Share Follow See all 0 reply Please log in or register to add a comment.