Let L be a regular language. Prove that ChopFirstAndLast(L) isalso regular. A word is in ChopFirstAndLast(L) if it can be createdby taking a word in L and removing the first and last letters.
Expert Answer
An answer will be send to you shortly. . . . .