1. Engineering
  2. Computer Science
  3. only for b ii please provide a detailed proof i...

Question: only for b ii please provide a detailed proof i...

Question details

Only for b) ii)(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

please provide a detailed proof. I understand that you can concatenate AB to create a DFA that recognized the language of b) ii), but what does the proof look like in this case. Thank you

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