Question: 6) Let L be a regular language. Show that the following languages are regular. a) The set P = {u|uv L} of prefixes of L.
6) Let L be a regular language. Show that the following languages are regular. a) The set P = {u|uv L} of prefixes of L. b) The set L R = {w R|w L} of reversals of L.
Show how to build the required DFAs and prove that your method works.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
