1. Engineering
  2. Computer Science
  3. 3 for any string wwwwn the reverse of w written...

Question: 3 for any string wwwwn the reverse of w written...

Question details

(3) For any string www.Wn, the reverse of w written w is the string in reverse order unun-1 wi. For any language AR-(wR | w є A} b) If A is regular and B is regular, prove that the following languages are regular. i) {wRyR | tve A, ye B} îs regular ii) (u, abia2b2 . . .anbn | aia2 an є A and bibz bn є B). Hint: create a state for pairs of states of the form (A,B) for ga, a states in the DFAs for A and B respectively

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution