{"id":18772,"date":"2019-12-10T05:41:50","date_gmt":"2019-12-10T05:41:50","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/theory-of-computation-cse-5th-sem-syllabus-for-be-2017-regulation-anna-univ\/"},"modified":"2019-12-10T05:41:50","modified_gmt":"2019-12-10T05:41:50","slug":"theory-of-computation-cse-5th-sem-syllabus-for-be-2017-regulation-anna-univ","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/theory-of-computation-cse-5th-sem-syllabus-for-be-2017-regulation-anna-univ\/","title":{"rendered":"Theory of Computation Cse 5th Sem Syllabus for BE 2017 Regulation Anna Univ"},"content":{"rendered":"<p>Theory of Computation detail syllabus for Computer Science &amp; Engineering (Cse), 2017 regulation is taken from <a href=\"https:\/\/www.annauniv.edu\/\" target=\"_blank\" rel=\"noopener\">Anna University<\/a> official website and presented for students of Anna University. The details of the course are: course code (CS8501), Category (PC), Contact Periods\/week (3), Teaching hours\/week (3), Practical Hours\/week (0). The total course credits are given in combined syllabus.<\/p>\n<p>For all other cse 5th sem syllabus for be 2017 regulation anna univ you can visit <a href=\"..\/cse-5th-sem-syllabus-for-be-2017-regulation-anna-univ\">Cse 5th Sem syllabus for BE 2017 regulation Anna Univ Subjects<\/a>. The detail syllabus for theory of computation is as follows.&#8221;<\/p>\n<p><h4>Course Objective:<\/h4>\n<ul>\n<li>To understand the language hierarchy<\/li>\n<li>To construct automata for any given pattern and find its equivalent regular expressions<\/li>\n<li>To design a context free grammar for any given language<\/li>\n<li>To understand Turing machines and their capability<\/li>\n<li>To understand undecidable problems and NP class problems<\/li>\n<\/ul>\n<p><h4>Unit I<\/h4>\n<p>For complete syllabus and results, class timetable and more pls <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n<p><h4>Unit II<\/h4>\n<p><strong>Regular Expressions and Languages<\/strong><br \/>\nRegular Expressions &#8211; FA and Regular Expressions &#8211; Proving Languages not to be regular -Closure Properties of Regular Languages &#8211; Equivalence and Minimization of Automata.\n<\/p>\n<p><h4>Unit III<\/h4>\n<p><strong>Context Free Grammar and Languages<\/strong><br \/>\nCFG &#8211; Parse Trees &#8211; Ambiguity in Grammars and Languages &#8211; Definition of the Pushdown Automata &#8211; Languages of a Pushdown Automata &#8211; Equivalence of Pushdown Automata and CFG, Deterministic Pushdown Automata.\n<\/p>\n<p><h4>Unit IV<\/h4>\n<p>For complete syllabus and results, class timetable and more pls <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n<p><h4>Unit V<\/h4>\n<p><strong>Undecidability<\/strong><br \/>\nNon Recursive Enumerable (RE) Language &#8211; Undecidable Problem with RE &#8211; Undecidable Problems about TM &#8211; Posts Correspondence Problem, The Class P and NP.\n<\/p>\n<p><h4>Course Outcome:<\/h4>\n<p>Upon completion of the course, the students will be able to:<\/p>\n<ul>\n<li>Construct automata, regular expression for any pattern.<\/li>\n<li>Write Context free grammar for any construct.<\/li>\n<li>Design Turing machines for any language.<\/li>\n<li>Propose computation solutions using Turing machines.<\/li>\n<li>Derive whether a problem is decidable or not.<\/li>\n<\/ul>\n<p><h4>Text Books:<\/h4>\n<ol>\n<li>J.E.Hopcroft, R.Motwani and J.D Ullman, Introduction to Automata Theory, Languages and Computations, Second Edition, Pearson Education, 2003.<\/li>\n<\/ol>\n<p><h4>References:<\/h4>\n<ol>\n<li>H.R.Lewis and C.H.Papadimitriou, Elements of the theory of Computation, Second Edition, PHI, 2003.<\/li>\n<li>J.Martin, Introduction to Languages and the Theory of Computation, Third Edition, TMH, 2003.<\/li>\n<li>Micheal Sipser, Introduction of the Theory and Computation, Thomson Brokecole, 1997.<\/li>\n<\/li>\n<\/ol>\n<p>For detail syllabus of all other subjects of BE Cse, 2017 regulation do visit <a href=\"..\/category\/cse+5th-sem\">Cse 5th Sem syllabus for 2017 Regulation<\/a>.<\/p>\n<p>Dont forget to <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">download iStudy<\/a> for latest syllabus and results, class timetable and more.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Theory of Computation detail syllabus for Computer Science &amp; Engineering (Cse), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of [&hellip;]<\/p>\n","protected":false},"author":2297,"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":[48,69],"tags":[],"class_list":["post-18772","post","type-post","status-publish","format-standard","hentry","category-5th-sem","category-cse"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/18772","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/users\/2297"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/comments?post=18772"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/18772\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=18772"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=18772"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=18772"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}