Question 10096 –

Given that L is a language accepted by a finite state machine, show that L^P and L^R are also accepted by some finite state machines, where
L^P = {s|ss’ ∈ L, for some string s’}
L^R = {s|s obtainable by reversing some string in L}

Correct Answer: A