0 votes 0 votes Show that the family of context-sensitive languages is closed under reversal. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation turing-machine recursive-and-recursively-enumerable-languages proof + – Rishi yadav asked Mar 17, 2019 Rishi yadav 131 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.