Simple equations on binary factorial languages

Avgustinovich, 2005, A unique decomposition theorem for factorial languages, Internat. J. Algebra Comput., 15, 149, 10.1142/S0218196705002116 Avgustinovich, 2006, Canonical decomposition of a regular factorial language, vol. 3967, 18 Choffrut, 2000, On Fatou properties of rational languages, 227 Conway, 1971 Diekert, 2002, Makanin’s algorithm, 387 Frid, 2007, Canonical decomposition of a catenation of factorial languages, Sib. Elektron. Mat. Izv., 4, 14 Frid, 2007, Commutation of binary factorial languages, vol. 4588, 193 Karhumäki, 2005, Commutation with codes, Theoret. Comput. Sci., 340, 322, 10.1016/j.tcs.2005.03.037 Karhumäki, 2005, The commutation with ternary sets of words, Theory Comput. Syst., 38, 161, 10.1007/s00224-004-1191-1 Kunc, 2007, The power of commuting with finite sets of words, Theory Comput. Syst., 40, 521, 10.1007/s00224-006-1321-z Kunc, 2007, What do we know about language equations?, vol. 4588, 23 Lothaire, 1983 Ratoandromanana, 1989, Codes et motifs, RAIRO Inform. Theor., 23, 425, 10.1051/ita/1989230404251 Salomaa, 2000, On the decomposition of finite languages, 22