2 votes 2 votes How to prove shuffle ,perfect shuffle and Drop-out property of Regular languages ? Theory of Computation theory-of-computation regular-language closure-property + – Prajwal Bhat asked Oct 24, 2017 Prajwal Bhat 555 views answer comment Share Follow See 1 comment See all 1 1 comment reply Manu Thakur commented Oct 24, 2017 reply Follow Share I don't think so, it's required for the Gate preparations. you can memorize few things. 0 votes 0 votes Please log in or register to add a comment.