Automata

Assignment 4, due 2/13/2020 in class 1. The string reversal operator sR reverses the string. For example, (0100011) R = 1100010, and (bravo) R = ovarb. The language reversal operator is defined as follows: LR = {wR|WE L} Show that regular languages are closed under reversal. (Hint: Show how to transform a regular expression to express the reversal of the language.) 2. Use the closure of regular language under reversal to prove that the following language is not regular: L = {1"0" >0}