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.
3
-
$\begingroup$ @HendrikJan I belive those are for $x \neq y$ as opposed to $x \neq y^{R}$. $\endgroup$– DairNov 20 at 18:55
-
1$\begingroup$ Can you design a CFG for $\{x x^R \mid x \in \{a,b\}^*\}$ first? $\endgroup$– StevenNov 20 at 21:31
-
$\begingroup$ @Dair You are right. Thanks. I will delete my comment. $\endgroup$– Hendrik JanNov 21 at 1:52
Add a comment
|