Theoretical Computer Science:
Q: For languages A and B, let the perfect shuffle of A and B be the language {w | w = a1b1....akbk, where a1...ak ∈ A and =b1...bk ∈ B, each ai, bi ∈ Σ }
Show that the class of regular languages is closed under perfect shuffle.