Chapter 13 - Section 13.3 - Finite-State Machines with No Output - Exercises - Page 875: 3

A={1, 101}, B = {0,11,000}; A = {10,111,1010,1000,10111,101000}, B = {λ}; A = {λ, 10}, B = {10, 111, 1000} or A = {λ}, B = {10, 111, 1010, 1000, 10111, 101000}

All pairs of sets of strings A and B for which AB== {10, 111, 1010, 1000, 10111, 101000}. will be A={1, 101}, B = {0,11,000}; A = {10,111,1010,1000,10111,101000}, B = {λ}; A = {λ, 10}, B = {10, 111, 1000} or A = {λ}, B = {10, 111, 1010, 1000, 10111, 101000}