Question

If E= FG, E^r=?

(a) F^rG^r

(b) G^rF^r

(c) Both (a) and (b)

(d) None of the mentioned

The question was posed to me by my college professor while I was bunking the class.

This question is from Reversal-Homomorphism and Inverse Homomorphism in chapter Properties of Regular Languages of Automata Theory

Answer 1

Correct answer is (b) G^rF^r

The explanation: If E= FG, E^r=G^rF^r . Example: (01*)R=(1*)R(0)R