{"id":17169,"date":"2020-09-09T08:32:33","date_gmt":"2020-09-09T08:32:33","guid":{"rendered":"https:\/\/www.inspirenignite.com\/mh\/ce503-theory-of-computations-syllabus-for-ce-5th-sem-2017-18-dbatu\/"},"modified":"2020-09-09T08:32:33","modified_gmt":"2020-09-09T08:32:33","slug":"ce503-theory-of-computations-syllabus-for-ce-5th-sem-2017-18-dbatu","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/mh\/ce503-theory-of-computations-syllabus-for-ce-5th-sem-2017-18-dbatu\/","title":{"rendered":"CE503: Theory of Computations Syllabus for CE 5th Sem 2017-18 DBATU"},"content":{"rendered":"<p align=\"justify\">Theory of Computations detailed syllabus scheme for B.Tech Computer Engineering (CE), 2017-18 onwards has been taken from the <a href=\"https:\/\/dbatu.ac.in\/syllabus-and-course-structure-for-b-tech-programs\/\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">DBATU<\/a> 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. <\/p>\n<p align=\"justify\">For all other DBATU Syllabus for Computer Engineering 5th Sem 2017-18, do visit <a href=\"..\/dbatu-syllabus-for-computer-engineering-5th-sem-2017-18\">CE 5th Sem 2017-18 Onwards Scheme<\/a>. The detailed syllabus scheme for theory of computations is as follows.<\/p>\n<h2 align=\"center\">Theory of Computations Syllabus for Computer Engineering (CE) 3rd Year 5th Sem 2017-18 DBATU<\/h2>\n<p>  <title>Theory of Computations<\/title><\/p>\n<h4>Course Objectives and Outcomes:<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdf platform to make students&#8217;s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>.  <\/p>\n<h4>Unit I<\/h4>\n<p>  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.<\/p>\n<h4>Unit II<\/h4>\n<p>  Context Free Grammars: Definition, Production rules, Ambiguous grammar, Removal of ambiguity, Chomsky hierarchy, Context Free Grammar (CFG) &#8211; definition, Simplification of CFG.<\/p>\n<h4>Unit III<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdf platform to make students&#8217;s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>.  <\/p>\n<h4>Unit IV<\/h4>\n<p>  Pushdown Automata: Formal definition, Pushdown automata (PDA), Deterministic Pushdown automata (DPDA) &#8211; definition, Non-deterministic Pushdown automata (NPDA)-definition, relative powers of DPDA and NPDA.<\/p>\n<h4>Unit V<\/h4>\n<p>  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.<\/p>\n<h4>Unit VI<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdf platform to make students&#8217;s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>.  <\/p>\n<h4>Text Books:<\/h4>\n<ol>\n<li>Hopcroft, Ullman, Motwani, Introduction to Automata Theory, Languages, and Computation, Addison Wesley Publication.<\/li>\n<li>Daniel I. A. Cohen, Introduction to Computer Theory, Wiley Publication.<\/li>\n<\/ol>\n<h4>Reference Book:<\/h4>\n<ol>\n<li>John C. Martin, Introduction to Languages and Theory of Computation, McGraw Hill Publication.<\/li>\n<li>Krithivasan Kamala, Introduction to Formal Languages, Automata Theory and Computation, Pearson Education.<\/li>\n<li>Papadimitriou, Lewis, Elements of the Theory of Computations, PHI Publication.<\/li>\n<li>E. V. Krishnmurthy, Theory of Computer Science, EWP Publication.<\/li>\n<\/ol>\n<p align=\"justify\">For detail syllabus of all other subjects of Computer Engineering (CE) 5th Sem 2017-18 regulation, visit <a href=\"..\/category\/dbatu\/5th-sem-dbatu\">CE 5th Sem Subjects<\/a> syllabus for 2017-18 regulation.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>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 [&hellip;]<\/p>\n","protected":false},"author":2351,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[97,105],"tags":[],"class_list":["post-17169","post","type-post","status-publish","format-standard","hentry","category-5th-sem-dbatu","category-ce-dbatu"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/17169","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/users\/2351"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/comments?post=17169"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/17169\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/media?parent=17169"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/categories?post=17169"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/tags?post=17169"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}