Let L1 = L (a∗baa∗) and L2 = L (aba∗). Find L1/L2

The operation L1/L2 is called the right quotient of L1 by L2. It is defined as the set of all strings x such that for some string y in L2, the concatenation xy is in L1.

Given L1 = L (a∗baa∗) and L2 = L (aba∗), we need to find all strings x such that for some string y in L2, the concatenation xy is in L1.

The language L1 consists of all strings that start with zero or more 'a's, followed by a 'b', followed by two 'a's, followed by zero or more 'a's. The language L2 consists of all strings that start with an 'a', followed by a 'b', followed by zero or more 'a's.

To find L1/L2, we need to find all strings x such that for some string y in L2, the concatenation xy is in L1.

The string y in L2 can be 'ab' followed by zero or more 'a's. The string x in L1 must then be zero or more 'a's, followed by a 'b', followed by two 'a's, followed by zero or more 'a's.

Therefore, the right quotient L1/L2 is the language L (a∗baa∗).