- Teacher: Dr. Vishal Badgujar
- Teacher: Shradha Birje
- Teacher: Sachin Kasare
- Teacher: Prof. Snehal Mali
- Teacher: Kashilkar Manjusha
- Teacher: Syed Shafaque Fatma
- Teacher: Kashilkar Manjusha
- Teacher: Mahajan Shweta
- Teacher: Patil Urjashree
This course introduces the fundamental concepts of Automata Theory, which forms the theoretical foundation of computer science and formal language processing. It focuses on the study of abstract machines (automata) and the computational problems they can solve.
Students will learn about different models of computation such as Finite Automata (DFA and NFA), Regular Expressions, Context-Free Grammars (CFG), and Pushdown Automata (PDA). The course also covers Turing Machines, which represent the most powerful model of computation.
Key topics include language classification, parsing techniques, and the hierarchy of formal languages. The course helps students understand how compilers, interpreters, and programming languages are designed and analyzed.
By the end of this course, students will be able to design automata for given problems, convert between different representations, and analyze the computational capabilities and limitations of various models.
- Teacher: Charul Singh
