0 votes 0 votes The symmetric difference of two sets $S_1$ and $S_2$ is defined as $S_1 θ S_2 =$ {$x: x ∈ S_1$ or $x ∈ S_2,$ but $x$ is not in both $S_1$ and $S_2$}. Show that the family of regular languages is closed under symmetric difference. 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 150 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.