title: Is { w | w <> w^R } over the alphabet {0,1} a context-free language?
body: <p>I'd really love your help with this deciding whether the language of all words over the alphabet <code>{0,1}</code> that can't be read from both sides the same way, <code>{ w | w &lt;> w<sup>R</sup> }</code>, is a context-free language (that is, it can be transformed into specific grammar rules).</p>
  
  <p>I tried to prove that it is not a context-free language by the pumping lemma, but I didn't find a string which will lead me to contradiction.</p>
  
  <p>Any suggestions?</p>