About this Course
Welcome to the "Automata and Computability" course! This course explores theoretical models of computation, including finite automata, context-free grammars, and Turing machines. It examines how these models define the limits of computation, analyse algorithmic complexity, and apply formal logic techniques to problem-solving. It delves into computability theory, covering decidable and undecidable problems, NP-completeness, and the Chomsky hierarchy. Learners will explore regular expressions, context-free languages, and recursive functions to understand language processing and formal grammars. Through hands-on experience with proof techniques, algorithmic problem analysis, and formal verification, this course builds a strong foundation in computational theory. By the end, learners will develop advanced reasoning skills applicable to theoretical computer science, software development, and artificial intelligence research. Ideal for computer science students, software engineers, and researchers, this course strengthens understanding of automata, formal languages, and complexity theory
What You'll Learn
- Master finite automata, pushdown automata, and Turing machines to analyze computation limits
- Understand computability, NP-completeness, and complexity classes
- Apply proof techniques and logic to formalize computational models and algorithms
- Construct regular expressions and context-free grammars for pattern matching
Prerequisites
- Basic familiarity with the topic and its terminology
- Readiness to practice through applied exercises
Instructors
BITS Pilani Instructors Group