The document describes 6 statements about formal language theory and asks which are true. It discusses the relationships between regular languages (REG), context-free languages (CF), recursively enumerable languages (RE), and recursively decidable languages (REC) based on the Chomsky hierarchy. According to the solution, statements a, b, c, and d are true, while statements e and f are respectively false and true.