276 views
0 votes
0 votes
As we know that the regular languages are closed under complement. That means if L is regular than it's complement will also be regular.

What about the non regular languages? Are they closed under complement? Can we say that if L is non regular than it's complement will also be not regular?

Please explain.

1 Answer

0 votes
0 votes
yes,

non-regular language complement should be non-regular...

why?

let say L=non-regular ===> L' is complement of non-regular

Assume L' is regular ===> (L')' is regular (due to regular languages are closed under complementation)

we know that (L')' = L ===> L is regular ===> contradiction

Therefore our assumption is wrong

L' should be non-regular

Related questions

1 votes
1 votes
2 answers
1
Parshu gate asked Nov 29, 2017
853 views
Suppose in question we are given the language is Turing Recognizable , can I consider it a CFL or Regular?
3 votes
3 votes
3 answers
2
Parshu gate asked Nov 29, 2017
649 views
Suppose in question we are given the language is Turing Decidable , can I consider it a CFL or Regular?
0 votes
0 votes
0 answers
4
Purple asked Jan 12, 2017
289 views
Why is the answer D? How to solve it in simple way other than learning Rice Theorem? Does anyone know Rice thm in short?