This exercise is taken from book "introduction to computability theory" of Michael Sisper Given the languages A and B, the perfect shuffle of A and B is the language {w | w = a1b1a2b2 . . . akbk, where a1a2 . . . ak ∈ A and b1b2 . . . bk ∈ B, each ai, bi ∈ Σ}Σ={a,b} Show that the class of regular languages is closed under perfect shuffle, i.e. if A and B are regular languages then their perfect shuffle is also a regular language. Please anyone prove me the problem I described.
Asked
Active
Viewed 14 times
