Question

1. Consider the following languages over {0, 1}:

L₃ = {w : contains at most two 1’s and |w| = 3}

L₄ = {w : w = w^R, |w| £ 3}

Enumerate the first 7 strings in the L-ordering of the following:

1. L₃
2. L₄
3. L₃ – L₄
4. L₄ – L₃

Answer 1

Here as the number of strings in the L4 is less than the number of strings in L3 it results less number of strings as mentioned above .ie., L3 - L4 have only 4 strings.