0 votes 0 votes We defined the rotational closure of language $A$ to be $RC(A) = \{yx \mid xy \in A\}$.Show that the class of CFLs is closed under rotational closure. Theory of Computation michael-sipser theory-of-computation context-free-language closure-property descriptive + – admin asked Oct 12, 2019 admin 1.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Above link are usefull https://cs.stackexchange.com/questions/7831/easy-proof-for-context-free-languages-being-closed-under-cyclic-shift Himanshu Kumar Gupta answered Jul 13, 2020 Himanshu Kumar Gupta comment Share Follow See all 0 reply Please log in or register to add a comment.