Theory of Computations detailed syllabus scheme for B.Tech Computer Engineering (CE), 2017-18 onwards has been taken from the DBATU official website and presented for the Bachelor of Technology students. For Subject Code, Course Title, Lecutres, Tutorials, Practice, Credits, and other information, do visit full semester subjects post given below.
For all other DBATU Syllabus for Computer Engineering 5th Sem 2017-18, do visit CE 5th Sem 2017-18 Onwards Scheme. The detailed syllabus scheme for theory of computations is as follows.
Theory of Computations Syllabus for Computer Engineering (CE) 3rd Year 5th Sem 2017-18 DBATU
Course Objectives and Outcomes:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
.
Unit I
Finite Automata and Regular Expressions: Definition of deterministic finite automata, Non-deterministic finite automata, Moore and Mealy machines and their conversions, Regular expressions, Recursive definition, NFA with e-moves, Inter-conversion between NFA and DFA, Regular expression and FA, Pumping lemma.
Unit II
Context Free Grammars: Definition, Production rules, Ambiguous grammar, Removal of ambiguity, Chomsky hierarchy, Context Free Grammar (CFG) – definition, Simplification of CFG.
Unit III
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier..
Unit IV
Pushdown Automata: Formal definition, Pushdown automata (PDA), Deterministic Pushdown automata (DPDA) – definition, Non-deterministic Pushdown automata (NPDA)-definition, relative powers of DPDA and NPDA.
Unit V
Turing Machines: The definition of a Turing machine, Computing with Turing machine, Extensions of Turing machines, Random access Turing machines, Non-deterministic Turing machines, Grammars, The Churchs Turing hypothesis, Universal Turing machines, The Halting problem, Unsolvable problems about Turing machines.
Unit VI
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier..
Text Books:
- Hopcroft, Ullman, Motwani, Introduction to Automata Theory, Languages, and Computation, Addison Wesley Publication.
- Daniel I. A. Cohen, Introduction to Computer Theory, Wiley Publication.
Reference Book:
- John C. Martin, Introduction to Languages and Theory of Computation, McGraw Hill Publication.
- Krithivasan Kamala, Introduction to Formal Languages, Automata Theory and Computation, Pearson Education.
- Papadimitriou, Lewis, Elements of the Theory of Computations, PHI Publication.
- E. V. Krishnmurthy, Theory of Computer Science, EWP Publication.
For detail syllabus of all other subjects of Computer Engineering (CE) 5th Sem 2017-18 regulation, visit CE 5th Sem Subjects syllabus for 2017-18 regulation.