Theory Of Computation detailed syllabus for Computer Science & Engineering (CSE) for 2021-22 regulation curriculum has been taken from the Rajasthan Technical University official website and presented for the computer science & engineering students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.
For Computer Science & Engineering 4th Sem scheme and its subjects, do visit CSE 4th Sem 2021-22 regulation scheme. The detailed syllabus of theory of computation is as follows.
Unit 1
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 pdfs platform to make students’s lives easier.
.
Unit 2
Finite Automata & Regular Expression: Basic machine, Finite state machine, Transition graph, Transition matrix, Deterministic and non-deterministic finite automation, Equivalence of DFA and NDFA, Decision properties, minimization of finite automata, Mealy & Moore machines. Alphabet, words, Operations, Regular sets, relationship and conversion between Finite automata and regular expression and vice versa, designing regular expressions, closure properties of regular sets, Pumping lemma and regular sets, Myhill- Nerode theorem , Application of pumping lemma, Power of the languages.
Unit 3
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 pdfs platform to make students’s lives easier..
Unit 4
Nondeterministic PDA, Definitions, PDA and CFL, CFG for PDA, Deterministic PDA, and Deterministic PDA and Deterministic CFL , The pumping lemma for CFL’s, Closure Properties and Decision properties for CFL, Deciding properties of CFL.
Unit 5
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 pdfs platform to make students’s lives easier..
Unit 6
Tractable and Untractable Problems: P, NP, NP complete and NP hard problems, Un-decidability, examples of these problems like vertex cover problem, Hamiltonian path problem, traveling sales man problem.
For detailed syllabus of all other subjects of Computer Science & Engineering, 2021-22 regulation curriculum do visit CSE 4th Sem subject syllabuses for 2021-22 regulation.
For all Computer Science & Engineering results, visit Rajasthan Technical University computer science & engineering all semester results direct link.