• closed by
554 views
0 0 votes
closed as a duplicate of: Complement of Nonregular Language
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 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
Position:
Show:

Related questions

1 1 vote
2 2 answers
1.7k
1.7k views
Parshu gate asked Nov 29, 2017
1,734 views
Suppose in question we are given the language is Turing Recognizable , can I consider it a CFL or Regular?
3 3 votes
3 answers 3 answers
1.3k
1.3k views
Parshu gate asked Nov 29, 2017
1,327 views
Suppose in question we are given the language is Turing Decidable , can I consider it a CFL or Regular?
4 4 votes
1 answers 1 answer
1.7k
1.7k views
Parshu gate asked Nov 11, 2017
1,666 views
Which are the correct arguments?1) if A is a subset of B, and B is decidable, than A is guaranteed to be decidable.2) If L is Turing-decidable and L' is regular. Then L ∩...
0 0 votes
0 0 answers
455
455 views
Purple asked Jan 12, 2017
455 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? Let $M$ range over Turing machine descriptions. C...