Problem 5

Problem 4. For every regular language L, there exists language L (reverse of L), where for each string accepted by L, LR accepts that same string only with characters in reverse. Is LR regular? Prove your claim. Problem 5. Build both NDFSM and DFSM for the language over (a,by where the third from the last character in all accepted strings is a. Which one is easier to build? Write a regular expression to describe each of the following lan 1. fwE fa, b): every a is immediately preceeded and 2. fwE [a, b]:w has both aa and bb as a substring w E fa, b): w has length at least 3 and the th Problem 6. guages: 3. *'en does not end in bal