Question: solve 11a please 11. Let L be a regular language. Show that the following languages are regular. a) The set P={uuvL} of prefixes of strings
solve 11a please

11. Let L be a regular language. Show that the following languages are regular. a) The set P={uuvL} of prefixes of strings in L. b) The set LR={wRwL} of reversals of strings in L. c) The set E={uvvL} of strings that have a suffix in L. d) The set SUB={vuvwL} of strings that are substrings of a string in L
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
