Explain the Chomsky hierarchy of formal languages, including regular languages, context-free languages, context-sensitive languages, and recursively enumerable languages. Describe the automata models that correspond to each language class (finite automata, pushdown automata, linear bounded automata, and Turing machines). Analyze the relationships between these language classes and provide examples of languages that belong to each class. Discuss the theoretical significance of language classes for understanding the limits of computation and parsing.