For languages A and B, let the perfect shufe of A and B be
Chapter , Problem 1.41(choose chapter or problem)
For languages A and B, let the perfect shufe 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 shufe.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer