complement of language

Question

How to calculate complement of language where  $L=\left \{ a^{n}b^{n}c^{n}\ | n>=1 \right \}$

Comments

https://gateoverflow.in/58185/what-is-the-type-of-the-compliment-of-the-given-language-a-n-n-1

Answer 1

L= {abc,aabbcc, aaabbbccc,aaaabbbbcccc....................}

L'= L* - L= (a+b+c)* - {abc,aabbcc, aaabbbccc,aaaabbbbcccc....................}

L'= { null , a,aa,aaa,aaa..... b,bb,bbb,bbbb,.....c,cc,ccc,cccc,.........any combination of exept no. of "a" "b" "c" same where a comes before b and b comes before c}

Comments

Sir,

a^nb^n is the subset of Language containing equal number of a's and b's .

---

@vijay,

If so, then we can get similarly ba,cb,ca , too ...

---

This qus is answered here.

https://gateoverflow.in/25180/how-is-the-complement-of-language-l-is-context-free