Note: Show a complete proof for each item and statement.
Posted: Sat May 14, 2022 6:38 pm
Note: Show a complete proof for each item and statement.
= = {W = (a) Let Σ {a,b}, and consider the language L wR|W E 3*,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, E, R, S). iii. Give a pushdown automaton that generates L (drawing is enough). iv. Is L decidable?
- Note Show A Complete Proof For Each Item And Statement 1 (55.77 KiB) Viewed 31 times