Input (grade 13): Therefore, formal language theory is a major application area of computability theory and complexity theory.
Output (grade 11): This is the kind of question that computability theory and complexity theory ask.