Scribd
Upload
21 views7 pages

About The Course - TOC

Uploaded by

prasanna mishra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views7 pages

About The Course - TOC

Uploaded by

prasanna mishra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Theory of Computation (TOC)

(IT206)

Course Plan

Dr. Vijaypal Singh Rathor (Course Instructor)


Assistant Professor, Department of IT
(Email: [email protected])
Course Foundation L T P Credits
Type:
3 0 0 3

Course Credits
Course Syllabus/Plan
Introduction of Automata Theory, Set Theory, String, Basic Terminology, Language, Finite Automata. Finite
Module-1:
Automata as a language acceptor and translator,
Introduction of
Types of automata machines, Moore machines and mealy machines, composite machine, Conversion from Mealy
Automata Theory
to Moore and vice versa.
Deterministic finite automata (DFA) machines, Non-Deterministic Finite Automata (NDFA), conversion of NDFA to
Module-2: Finite DFA, minimization of automata machines,
Automata
Regular expression, Arden’s theorem. Meaning of union, intersection, concatenation and closure, 2-way DFA.
Types of grammar, context-sensitive grammar, context-free grammar, regular grammar. Derivation trees, ambiguity
Module-3: Context- in grammar, simplification of context-free grammar,
Free Grammars Conversion of grammar to automata machine and vice versa, Chomsky hierarchy of grammar, killing null and unit
productions. Chomsky normal form and Greibach normal form.
Module-4: Push Push down Automata, Example of PDA, deterministic and non-deterministic PDA,
down Automata Conversion of PDA into context free grammar and vice versa, CFG equivalent to PDA, Petrinet model.
Turing Machine, Techniques for construction. Universal Turing machine Multitape, multihead and multidimensional
Module-5: Turing Turing machine,
Machine N-P complete problems. Decidability and Recursively Enumerable Languages, decidability, decidable languages,
undecidable languages, Halting problem of Turing machine & the post correspondence problem.
Books:
• Introduction to Automata Theory Language & Computation, Hopcroft& Ullman, Narosa Publication.
• Theory of Computation, Chandrasekhar & Mishra, PHI.

3
Components of Course Evaluation Percentage
Project/Assignments
30
Quiz
Mid Term Examination 30
End Term Examination 40

Note: 1) The components and percentage may also be change later if required.
2) The weightage of attendance may also be added.

Evaluation Component
Course Information and Guidelines
• Classes will be conducted in physical mode. Three-hour lecture according to the timetable
(Any change in time will be communicated).

• As per the rule, 75% attendance is mandatory for appearing in the exams/tests.

• The course material and quiz/test/assignment/projects will be available/submitted on Canvas.

• The invitation to join the course on the Canvas portal will be sent to you via your institute
email.

5
Points to be Noted
• If you find any difficulty in this course, feel free to contact me.

• Please avoid sending unnecessary emails.

• Any unfair means found during the course, like copying assignments/projects and others, you
will be awarded an F with a grade in this course.

• If you are not getting a reply by email, please discuss the issue during class.

• Batch representative(s) will be informed for instant information circulation.

6
Thank You

You might also like