{"id":3471,"date":"2017-12-10T12:51:19","date_gmt":"2017-12-10T12:51:19","guid":{"rendered":"http:\/\/www.inspirenignite.com\/jntuh\/?p=3471"},"modified":"2020-06-18T15:01:56","modified_gmt":"2020-06-18T15:01:56","slug":"flat-syllabus-formal-languages-automata-theory-jntuh-b-tech-2016-17-r16","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuh\/flat-syllabus-formal-languages-automata-theory-jntuh-b-tech-2016-17-r16\/","title":{"rendered":"FLAT Syllabus (Formal Languages and Automata Theory) JNTUH B.Tech 2016-17 (R16)"},"content":{"rendered":"<p>FLAT syllabus (Formal Languages and Automata Theory) for JNTUH B.Tech II year II sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.<\/p>\n<h3>FLAT Syllabus (Formal Languages and Automata Theory) JNTUH R16<\/h3>\n<p>B.Tech. II Year II Sem. \u00a0 \u00a0L\/T\/P\/C<br \/>\nCourse Code: CS404ES 3\/0\/0\/3<\/p>\n<p><strong>Course Objectives:<\/strong><\/p>\n<ul>\n<li>To provide introduction to some of the central ideas of theoretical computer\u00a0science from the perspective of formal languages.<\/li>\n<li>To introduce the fundamental concepts of formal languages, grammars and\u00a0automata theory.<\/li>\n<li>Classify machines by their power to recognize languages.<\/li>\n<li>Employ finite state machines to solve problems in computing.<\/li>\n<li>To understand deterministic and non-deterministic machines.<\/li>\n<li>To understand the differences between decidability and undecidability.<\/li>\n<\/ul>\n<p><strong>Course Outcomes:<\/strong><\/p>\n<ul>\n<li>Able to understand the concept of abstract machines and their power to recognize\u00a0the languages.<\/li>\n<li>Able to employ finite state machines for modeling and solving computing\u00a0problems.<\/li>\n<li>Able to design context free grammars for formal languages.<\/li>\n<li>Able to distinguish between decidability and undecidability.<\/li>\n<li>Able to gain proficiency with mathematical tools and formal methods.<\/li>\n<\/ul>\n<p><strong>UNIT &#8211; I\u00a0<\/strong>Introduction to Finite Automata, Structural Representations, Automata and Complexity, the<br \/>\nCentral Concepts of Automata Theory \u2013 Alphabets, Strings, Languages, Problems.\u00a0Deterministic Finite Automata, Nondeterministic Finite Automata, an application: Text\u00a0Search, Finite Automata with Epsilon-Transitions.<\/p>\n<p><strong>UNIT &#8211; II\u00a0<\/strong>Regular Expressions, Finite Automata and Regular Expressions, Applications of Regular<br \/>\nExpressions, Algebraic Laws for Regular Expressions, Properties of Regular Languages Pumping\u00a0Lemma for Regular Languages, Applications of the Pumping Lemma, Closure\u00a0Properties of Regular Languages, Decision Properties of Regular Languages, Equivalence\u00a0and Minimization of Automata.<\/p>\n<p><strong>UNIT &#8211; III<\/strong>\u00a0Context-Free Grammars: Definition of Context-Free Grammars, Derivations Using a\u00a0Grammar, Leftmost and Rightmost Derivations, the Language of a Grammar, Sentential\u00a0Forms, Parse Tress, Applications of Context-Free Grammars, Ambiguity in Grammars and\u00a0Languages.\u00a0Push \u00a0Down Automata,: Definition of the Pushdown Automaton, the Languages of a PDA,\u00a0Equivalence of PDA&#8217;s and CFG&#8217;s, Deterministic Pushdown Automata.<\/p>\n<p style=\"text-align: center\"><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\"><strong><span style=\"color: #ff0000\">Download iStudy Android App for complete JNTUH syllabus, results, timetables and all other updates. There are no ads and no pdfs and will make your life way easier<\/span>.<\/strong><\/a><\/p>\n<p><strong>TEXT BOOKS:<\/strong><\/p>\n<ul>\n<li>Introduction to Automata Theory, Languages, and Computation, 3nd Edition, John E.\u00a0Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.<\/li>\n<li>Introduction to the Theory of Computation, Michael Sipser, 3rd edition, Cengage\u00a0Learning.<\/li>\n<\/ul>\n<p><strong>REFERENCE BOOKS:<\/strong><\/p>\n<ul>\n<li>Introduction to Languages and The Theory of Computation, John C Martin, TMH.<\/li>\n<li>Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.<\/li>\n<li>A Text book on Automata Theory, P. K. Srimani, Nasir S. F. B, Cambridge\u00a0University Press.<\/li>\n<li>Introduction to Formal languages Automata Theory and Computation Kamala\u00a0Krithivasan, Rama R, Pearson.<\/li>\n<li>Theory of Computer Science \u2013 Automata languages and computation, Mishra and\u00a0Chandrashekaran, 2nd edition, PHI.<\/li>\n<\/ul>\n<p>For all other B.Tech 2nd\u00a0Year 2nd Sem syllabus go to <a href=\"https:\/\/www.inspirenignite.com\/jntuh\/jntuh-second-year-second-sem-information-technology-course-structure-2016-2017-r16-batch\/\">JNTUH B.Tech Information Technology 2nd\u00a0Year 2nd Sem Course Structure for (R16) Batch.<\/a><\/p>\n<p>All details and yearly new syllabus will be updated here time to time. Subscribe, like us on facebook and follow us on google plus for all updates.<\/p>\n<p>Do share with friends and in case of questions please feel free drop a comment.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>FLAT syllabus (Formal Languages and Automata Theory) for JNTUH B.Tech II year II sem is covered here. This gives the details about credits, number of hours and other details along [&hellip;]<\/p>\n","protected":false},"author":2259,"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":[62],"tags":[],"class_list":["post-3471","post","type-post","status-publish","format-standard","hentry","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/3471","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/users\/2259"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/comments?post=3471"}],"version-history":[{"count":4,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/3471\/revisions"}],"predecessor-version":[{"id":22231,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/3471\/revisions\/22231"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=3471"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=3471"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=3471"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}