title: The complement of the language L={a^n b^n | n !=100}
body: <p>I dont need a proof, since this is an objective exam question and allowed 2 mins only. The options are <code>regular</code> or <code>cfl</code> or <code>csl</code>. I dont understand how to tackle this. </p>
  
  <p>If we I write it as </p>
  
  <pre><code>(a^n b^n | n&lt;100) UNION (a^n b^n | n&gt;100)
  </code></pre>
  
  <p>Now call first part L1 and second part L2 and then try to compliment using,</p>
  
  <blockquote>
    <p>De-morgons Law L'= L1' INTERSECTION L2'</p>
  </blockquote>
  
  <p>I dont think thats the right way or a quick way considering the fact we need to spend 2-3 mins only. Any better approch to this?</p>