Theory OF Automata and Computing (2 Units; L = 15; P = 45)
Course Outline
Introduction to Automata Theory and Formal Languages. Regular Languages and Finite Automata. Context-Free Grammars and Pushdown Automata. Non-Determinism and Kleene's Theorem. Turing Machines and Decidability. Advanced Topics in Automata Theory. Complexity Theory and NP-Completeness. Introduction to Computational Logic. Finite Automata and Regular Expression. Grammars, Parsers, and Parsing Techniques. Applications of Automata Theory in Compiler Design. Applications of Automata Theory in Natural Language Processing. Applications of Automata Theory in Computer Networks and Communication. Applications of Automata Theory in Software Engineering. Applications of Automata Theory in Artificial Intelligence and Machine Learning. Formal Verification and Model Checking. Future Directions in Automata Theory and Research.
- Teacher: LMS Admin