1 votes 1 votes If L1 and L2 are non-regular, then L1 ⋃ L2 is also non-regular. state the above statement is true or false? Theory of Computation test-series regular-language + – navya n asked Sep 3, 2018 • edited Sep 3, 2018 by Shaik Masthan navya n 319 views answer comment Share Follow See 1 comment See all 1 1 comment reply MiNiPanda commented Sep 3, 2018 reply Follow Share False.. L1=a^nb^m | n=m L2=a^nb^m| n not equal to m Both are CFL But their union gives a*b* which is regular. 3 votes 3 votes Please log in or register to add a comment.
0 votes 0 votes let L1= a^m b^n m,n>=1 m>=n non regular let l2=a^m b^n m,n>=1 m<n non regular union l3= a^m b^n m,n>=1 m>=n or m<n} equivalent to{ a^m b^n m,n>=1 } is regular Mayank Gupta 3 answered Sep 3, 2018 Mayank Gupta 3 comment Share Follow See all 0 reply Please log in or register to add a comment.