Question: Let = {a, b}, and consider the language L = {w = wR|w , l(w) is odd }, where wR denotes the reverse of w

Let = {a, b}, and consider the language L = {w = wR|w , l(w) is odd }, where wR denotes the reverse of w and l(w) denotes the length of w. i. Show that L is not regular. ii. Give a context free grammar G that generates L. G = (V, , R, S). iii. Give a pushdown automaton that generates L (drawing is enough). iv. Is L decidable?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!