The Gateway to Computer Science Excellence

test series

+1 vote
33 views
If L1 and L2 are non-regular, then L1⋃ L2 is also not-regular.

true or false?
in Theory of Computation by (365 points) | 33 views
0
False.
by Boss (12.9k points)

1 Answer

0 votes
Take counter examples to disapprove in such questions
Let a^nb^m where n!=m be L1 and a^nb^m where n=m be L2.
Both are non regular infact dcfl to be precise but their union is
a*b* a regular language.
by Active (1.2k points)
← Prev. Qn. in Sub. Next Qn. in Sub. →
← Prev. Next →

Related questions

0 votes
0 answers
4
ace academy test series
What is partial language?
asked Nov 21, 2018 in Theory of Computation by amitqy Active (1.9k points) | 59 views
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,297 answers
198,265 comments
104,979 users