0 votes 0 votes Let the rotational closure of language $A$ be $RC(A) = \{yx| xy ∈ A\}.$ Show that for any language $A,$ we have $RC(A) = RC(RC(A)).$ Show that the class of regular languages is closed under rotational closure. Theory of Computation michael-sipser theory-of-computation regular-language rotational-closure-of-language descriptive + – admin asked Apr 30, 2019 edited Apr 30, 2019 by Lakshman Bhaiya admin 405 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.