Question: Pumpable non-regular Let L subset sigma* be a language that is not regular, and let a NotElement sigma. (a) Show that the language {aw|w elementof

Pumpable non-regular Let L subset sigma* be a language that is not regular, and let a NotElement sigma. (a) Show that the language {aw|w elementof L} is not regular. (b) Consider the language L': L' = {aw|w elementof L} Union {a^k sigma* | k notequalto 1} Show that L' is not regular. (c) Show that every string in L' can be pumped
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
