Course : AUTOMATA AND COMPUTABILITY

Please solve as soon as possible

A Wrong Grammar (2 points) 2.0 points possible (graded, results hidden) Consider the following context-free language. L1 = {w {a,b}* : w is not a palindrome} Your friend comes up with the following grammar for L1. S +aSb | bSa | ab | ba Unfortunately, her grammar is wrong! For starters, the grammar does not generate any string of odd length. It does not generate all the non- palindromes of even length too. Find a length 4 string s E L that is not generated by the grammar above. There are many possible correct answers. Writing down any of them will work