{"id":50792,"date":"2023-03-22T07:15:53","date_gmt":"2023-03-22T07:15:53","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/cs3452-theory-of-computation-syllabus-for-aiml-2021-regulation\/"},"modified":"2023-03-22T07:15:53","modified_gmt":"2023-03-22T07:15:53","slug":"cs3452-theory-of-computation-syllabus-for-aiml-2021-regulation","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/cs3452-theory-of-computation-syllabus-for-aiml-2021-regulation\/","title":{"rendered":"CS3452: Theory of Computation syllabus for AI&ML 2021 regulation"},"content":{"rendered":"

Theory of Computation detailed syllabus for Artificial Intelligence & Machine Learning (AI&ML) for 2021 regulation curriculum has been taken from the Anna University<\/a> official website and presented for the AI&ML 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. <\/p>\n

For Artificial Intelligence & Machine Learning 4th Sem scheme and its subjects, do visit AI&ML 4th Sem 2021 regulation scheme<\/a>. The detailed syllabus of theory of computation is as follows. <\/p>\n

Theory of Computation<\/title><\/p>\n<h4>Course Objectives:<\/h4>\n<h4 id=\"istudy\" style=\"text-align:center\"><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">Download the iStudy App for all syllabus and other updates.<\/a><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&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;text-align:center\"><\/a><\/h4>\n<h4>Unit I<\/h4>\n<p> <strong>AUTOMATA AND REGULAR EXPRESSIONS 9<\/strong> Need for automata theory – Introduction to formal proof – Finite Automata (FA) – Deterministic Finite Automata (DFA) – Non-deterministic Finite Automata (NFA) – Equivalence between NFA and DFA -Finite Automata with Epsilon transitions – Equivalence of NFA and DFA- Equivalence of NFAs with and without -moves- Conversion of NFA into DFA – Minimization of DFAs.<\/p>\n<h4>Unit II<\/h4>\n<h4 id=\"istudy\" style=\"text-align:center\"><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">Download the iStudy App for all syllabus and other updates.<\/a><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&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;text-align:center\"><\/a><\/h4>\n<h4>Unit III<\/h4>\n<p> <strong>CONTEXT FREE GRAMMAR AND PUSH DOWN AUTOMATA 9<\/strong> Types of Grammar – Chomskys hierarchy of languages -Context-Free Grammar (CFG) and Languages – Derivations and Parse trees – Ambiguity in grammars and languages – Push Down Automata (PDA): Definition – Moves – Instantaneous descriptions -Languages of pushdown automata – Equivalence of pushdown automata and CFG-CFG to PDA-PDA to CFG – Deterministic Pushdown Automata.<\/p>\n<h4>Unit IV<\/h4>\n<h4 id=\"istudy\" style=\"text-align:center\"><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">Download the iStudy App for all syllabus and other updates.<\/a><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&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;text-align:center\"><\/a><\/h4>\n<h4>Unit V<\/h4>\n<p> <strong>UNDECIDABILITY 9<\/strong> Unsolvable Problems and Computable Functions -PCP-MPCP- Recursive and recursively enumerable languages – Properties – Universal Turing machine -Tractable and Intractable problems – P and NP completeness – Kruskals algorithm – Travelling Salesman Problem- 3-CNF SAT problems.<\/p>\n<h4>Course Outcomes:<\/h4>\n<h4 id=\"istudy\" style=\"text-align:center\"><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">Download the iStudy App for all syllabus and other updates.<\/a><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&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;text-align:center\"><\/a><\/h4>\n<h4>Text Books:<\/h4>\n<ol>\n<li>Hopcroft J.E., Motwani R. & Ullman J.D., “Introduction to Automata Theory, Languages and Computations”, 3rd Edition, Pearson Education, 2008.<\/li>\n<li>John C Martin , “Introduction to Languages and the Theory of Computation”, 4th Edition, Tata McGraw Hill, 2011.<\/li>\n<\/ol>\n<h4>Reference Books:<\/h4>\n<ol>\n<li>Harry R Lewis and Christos H Papadimitriou , “Elements of the Theory of Computation”, 2nd Edition, Prentice Hall of India, 2015.<\/li>\n<li>Peter Linz, “An Introduction to Formal Language and Automata”, 6th Edition, Jones & Bartlett, 2016.<\/li>\n<li>K.L.P.Mishra and N.Chandrasekaran, Theory of Computer Science: Automata Languages and Computation, 3rd Edition, Prentice Hall of India, 2006.<\/li>\n<\/ol>\n<p align=\"justify\">For detailed syllabus of all other subjects of Artificial Intelligence & Machine Learning, 2021 regulation curriculum do visit <a class=\"rank-math-link\" href=\"..\/category\/ai-ml+4th-sem\">AI&ML 4th Sem subject syllabuses for 2021 regulation<\/a>. <\/p>\n<p align=\"justify\">For all Artificial Intelligence & Machine Learning results, visit <a class=\"rank-math-link\" href=\"https:\/\/www.inspirenignite.com\/anna-university\/anna-university-results\/\">Anna University AI&ML all semester results<\/a> direct link. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>Theory of Computation detailed syllabus for Artificial Intelligence & Machine Learning (AI&ML) for 2021 regulation curriculum has been taken from the Anna University official website and presented for the AI&ML […]<\/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":[47,157],"tags":[],"class_list":["post-50792","post","type-post","status-publish","format-standard","hentry","category-4th-sem","category-aiml"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/50792","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=50792"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/50792\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=50792"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=50792"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=50792"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}