How can I convert this context free langauge to conext free grammar? Please help I can not solve this problem for days. L = {xy : x, y ∈ {a, b} ∗ , |x| = |y| and x ̸= y^R} where y^R is the reverse of y.

  • $\begingroup$ @HendrikJan I belive those are for $x \neq y$ as opposed to $x \neq y^{R}$. $\endgroup$
    – Dair
    Nov 20 at 18:55
  • 1
    $\begingroup$ Can you design a CFG for $\{x x^R \mid x \in \{a,b\}^*\}$ first? $\endgroup$
    – Steven
    Nov 20 at 21:31
  • $\begingroup$ @Dair You are right. Thanks. I will delete my comment. $\endgroup$ Nov 21 at 1:52


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Browse other questions tagged or ask your own question.