This course introduces the fundamental concepts of automata theory and formal languages to understand the theoretical underpinnings that govern the limits and capabilities of computation. This course covers the theoretical models of computation from finite automata to the more powerful models, such as pushdown automata and Turing machines; principles of formal languages, including regular languages, context-free languages, and context-sensitive languages; grammar and syntax analysis, including context-free grammar and parsing techniques; decidability and undecidability to explore the limits of computation; computability theory; and applications in compiler design. This course requires MAT-201 as a prerequisite.