Introduction to Automata Languages and Computation

By Prof. Sourav Mukhopadhyay   |   IIT Kharagpur
Learners enrolled: 195
Automata, Languages and Computation have been an important part of the curriculum in computer science department for several decades.The automata theory is the study of abstract machines and theirapplication in solving computational problems. Automata is a major part of this course, and is explained elaborately throughout in easily comprehensible ways. Besides providing students with a detailedintroduction to the theories related to computer science, this course also fully covers mathematical preliminaries which are essential to computation.

Course Status : Upcoming
Course Type : Core
Duration : 12 weeks
Start Date : 23 Jan 2023
End Date : 14 Apr 2023
Exam Date : 29 Apr 2023 IST
Enrollment Ends : 30 Jan 2023
Category :
  • Computer Science and Engineering
Credit Points : 3
Level : Undergraduate/Postgraduate

Page Visits

Course layout

Week 1  :  Finite automata and regular languages
Week 2  :  Regular expressions
Week 3  :  Equivalence of DFA and NFA
Week 4  :  Minimization of finite automata
Week 5  :  Pumping lemma and its application
Week 6  :  Context-free grammars and context-free languages
Week 7  :  Chomsky normal form, closure properties
Week 8  :  Push down automata
Week 9  :  Computability
Week 10  :  Turing machines and variants
Week 11  :  Time complexity of Turing machines
Week 12  :  P and NP, NP- completeness

Books and references

N. J. Cutland: Computability: An Introduction to Recursive Function Theory, Cambridge University Press, London,1980.2. M. D. Davis, R. Sigal and E. J. Weyuker: Complexity, Computability and Languages, Academic Press, New York,1994.3. J. E. Hopcroft and J. D. Ullman: Introduction to Automata Theory, Languages and Computation, Addison-Wesley,California, 1979.4. J. E. Hopcroft, J. D. Ullman and R. Motwani: Introduction to Automata Theory, Languages and Computation, Addison-Wesley, California, 2001.5. H. R. Lewis and C. H. Papadimitriou: Elements of The Theory of Computation, Prentice Hall, Englewood Cliffs, 1981.6. M. Sipser: Introduction to The Theory of Computation, PWS Pub. Co., New York, 1999.7. M. R. Garey and D. S. Johnson: Computers and Intractability: A Guide to The Theory of NPCompleteness, Freeman, New York, 1979.

Instructor bio

Prof. Sourav Mukhopadhyay

IIT Kharagpur
Sourav Mukhopadhyay is an Associate Professor, Department of Mathematics at Indian Institute of Technology Kharagpur. He has completed his B.Sc (Honours in Mathematics) in1997 from University of Calcutta, India. He has done M.Stat (in statistics) and M.Tech (in computer science) from Indian Statistical Institute, India, in 1999 and 2001 respectively. He worked with Cryptology Research Group at Indian Statistical Institute as a PhD student and received his Ph.D. degree in Computer Science from there in 2007. He was a Research Assistant at the Computer Science department of School of Computing, National University of Singapore (NUS). He visited Inria Rocquencourt, project CODES, France and worked as a post-doctoral research fellows at the School of Computer Engineering, Nanyang Technological University (NTU), Singapore. He was a post-doctoral research fellows and a part time Lecturer with School of Electronic Engineering, Dublin City University (DCU), Ireland.

Course certificate

The course is free to enroll and learn from. But if you want a certificate, you have to register and write the proctored exam conducted by us in person at any of the designated exam centres.
The exam is optional for a fee of Rs 1000/- (Rupees one thousand only).
Date and Time of Exams: 
29 April 2023 Morning session 9am to 12 noon; Afternoon Session 2pm to 5pm.
Registration url: Announcements will be made when the registration form is open for registrations.
The online registration form has to be filled and the certification exam fee needs to be paid. More details will be made available when the exam registration form is published. If there are any changes, it will be mentioned then.
Please check the form for more details on the cities where the exams will be held, the conditions you agree to when you fill the form etc.


Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

Certificate will have your name, photograph and the score in the final exam with the breakup.It will have the logos of NPTEL and IIT Kharagpur .It will be e-verifiable at nptel.ac.in/noc.

Only the e-certificate will be made available. Hard copies will not be dispatched.

Once again, thanks for your interest in our online courses and certification. Happy learning.

- NPTEL team

MHRD logo Swayam logo


Goto google play store