1/

2/

Write a CFG deciding the language {x{a,b} abb is not a prefix of x} Applying the product construction to D1 and D2 above results in the states of D shown below (pairs such as (a,x) are abbreviated ax). Draw the start state and transitions of D. However, do not circle any accept states. For the questions below, write each state explicitly; do not write an abstract description of the set. L(D)=L(D1)L(D2)? L(D)=L(D1)L(D2)? L(D)=L(D1)\L(D2)? (also written L(D1)L(D2) )