0 votes 0 votes “The family of regular languages is closed under difference.” Provide constructive proof for this argument. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language closure-property + – Naveen Kumar 3 asked Apr 4, 2019 Naveen Kumar 3 149 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.