Short forms:

a^x = a repeated x times

PDA= Push Down Automata

CFG = Context Free Grammer

Problem 3 Regular Languages Context Free Languages Given a languages A and Bover the alphabet 10, 1h, PerfectShuffle of A and B is defined as the language Perfect Shuffle(A, B) Haibhazb2 ak I such that aia2 an EA and bib2 bn e Bh (a) For A Ik 20) and B Ha't lk 20, describe precisely using set notation, what PerfectShuffle (A, B) is. 12 points]