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.
INTENDED AUDIENCE : Engineering
INDUSTRY SUPPORT : Software
ABOUT THE INSTRUCTOR:
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.
Certification Process
1. Join the course
Learners may pay the applicable fees and enrol to a course on offer in the portal and get access to all of its contents including assignments. Validity of enrolment, which includes access to the videos and other learning material and attempting the assignments, will be mentioned on the course. Learner has to complete the assignments and get the minimum required marks to be eligible for the certification exam within this period.
COURSE ENROLMENT FEE: The Fee for Enrolment is Rs. 3000 + GST
2. Watch Videos+Submit Assignments
After enrolling, learners can watch lectures and learn and follow it up with attempting/answering the assignments given.
3. Get qualified to register for exams
A learner can earn a certificate in the self paced course only by appearing for the online remote proctored exam and to register for this, the learner should get minimum required marks in the assignments as given below:
CRITERIA TO GET A CERTIFICATE
Assignment score = Score more than 50% in at least 9/12 assignments.
Exam score = 50% of the proctored certification exam score out of 100
Only the e-certificate will be made available. Hard copies will not be dispatched.”
4. Register for exams
The certification exam is conducted online with remote proctoring. Once a learner has become eligible to register for the certification exam, they can choose a slot convenient to them from what is available and pay the exam fee. Schedule of available slot dates/timings for these remote-proctored online examinations will be published and made available to the learners.
EXAM FEE: The remote proctoring exam is optional for a fee of Rs.1500 + GST. An additional fee of Rs.1500 will apply for a non-standard time slot.
5. Results and Certification
After the exam, based on the certification criteria of the course, results will be declared and learners will be notified of the same. A link to download the e-certificate will be shared with learners who pass the certification exam.
CERTIFICATE TEMPLATE
Course Details
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.
Reviews
There are no reviews yet.
Be the first to review “Introduction to Automata, Languages and Computation” Cancel reply
Reviews
There are no reviews yet.